2013
DOI: 10.1007/978-3-642-36279-8_14
|View full text |Cite
|
Sign up to set email alerts
|

Space-Time Group Motion Planning

Abstract: We present a novel approach for planning and directing heterogeneous groups of virtual agents based on techniques from linear programming. Our method efficiently identifies the most promising paths in both time and space and provides an optimal distribution of the groups' members over these paths such that their average traveling time is minimized. The computed space-time plan is combined with an agent-based steering method to handle collisions and generate the final motions of the agents. Our overall solution… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 27 publications
0
10
0
Order By: Relevance
“…[Karamouzas and Overmars 2012] extend this research trying to model macro/microscopic behaviors: for each time step agents follow the group path but solve its own path following problem autonomously. [Karamouzas et al 2013] adopt minimization of space and time and is based on a linear programming technique to resolve congestions and prevent deadlocks. Note that a weak point of these methods is not to consider the full dynamic nature of the social space, e.g.…”
Section: Related Workmentioning
confidence: 99%
“…[Karamouzas and Overmars 2012] extend this research trying to model macro/microscopic behaviors: for each time step agents follow the group path but solve its own path following problem autonomously. [Karamouzas et al 2013] adopt minimization of space and time and is based on a linear programming technique to resolve congestions and prevent deadlocks. Note that a weak point of these methods is not to consider the full dynamic nature of the social space, e.g.…”
Section: Related Workmentioning
confidence: 99%
“…We focus on minimizing the travel time of the agents, but other metrics have been studied in the literature. For example, the work in [48,56,27] addresses the problem of minimizing the total length of the path of the agents, formulating the path planning problem as a mixed integer linear program. Coordinating the motion of a set of pebbles in a graph to minimize the number of moves was studied in [33].…”
Section: Multi-agent Navigationmentioning
confidence: 99%
“…Approaches [25] and [26] show a combined planning methods based on network flow and medial axis. In particular, the former provides an interesting parallelism among network flow problem on a graph and multi-agent path planning problem, but it fails in providing an applicable solution.…”
Section: A Related Workmentioning
confidence: 99%