Access the full text.
Sign up today, get DeepDyve free for 14 days.
Jingjin Yu, S. LaValle (2012)
Multi-agent Path Planning and Network FlowArXiv, abs/1204.5717
Joseph Mitchell (1991)
A new algorithm for shortest paths among obstacles in the planeAnnals of Mathematics and Artificial Intelligence, 3
Jirí Svancara, Pavel Surynek (2017)
New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding
Hang Ma, Sven Koenig (2016)
Optimal Target Assignment and Path Finding for Teams of AgentsArXiv, abs/1612.05693
Renato Farias, Marcelo Kallmann (2018)
GPU-Based Max Flow Maps in the PlaneRobotics: Science and Systems XIV
G. Strang (1983)
Maximal flow through a domainMathematical Programming, 26
C. Camporesi, Marcelo Kallmann (2014)
Computing shortest path maps with GPU shadersProceedings of the 7th International Conference on Motion in Games
Pavel Surynek (2010)
An Optimization Variant of Multi-Robot Path Planning Is IntractableProceedings of the AAAI Conference on Artificial Intelligence
Joseph Mitchell (1988)
On maximum flows in polyhedral domainsJ. Comput. Syst. Sci., 40
Adam Barnett, Hubert Shum, T. Komura (2016)
Coordinated Crowd Simulation With Topological Scene AnalysisComputer Graphics Forum, 35
Ioannis Karamouzas, Roland Geraerts, A.F. Stappen (2012)
Space-Time Group Motion Planning
(2013)
2013a).Multi-agent path planning and network flow. Algorithmic foundations of robotics X (pp. 157–173)
Kiril Solovey, Jingjin Yu, Or Zamir, D. Halperin (2015)
Motion Planning for Unlabeled Discs with Optimality GuaranteesArXiv, abs/1504.05218
Jingjin Yu, S. LaValle (2012)
Planning optimal paths for multiple robots on graphs2013 IEEE International Conference on Robotics and Automation
L. Gewali, A. Meng, Joseph Mitchell, S. Ntafos (1988)
Path planning in 0/1/ weighted regions with applicationsINFORMS J. Comput., 2
Hang Ma, Sven Koenig (2017)
AI buzzwords explained: multi-agent path finding (MAPF)AI Matters, 3
Kristóf Bérczi, Yusuke Kobayashi (2017)
The Directed Disjoint Shortest Paths Problem
JSB Mitchell (1990)
10.1016/0022-0000(90)90020-LJournal of Computer and System Sciences, 40
Guni Sharon, Roni Stern, Ariel Felner, Nathan Sturtevant (2012)
Conflict-based search for optimal multi-agent pathfinding
Andrew Dobson, Kiril Solovey, Rahul Shome, D. Halperin, Kostas Bekris (2017)
Scalable asymptotically-optimal multi-robot motion planning2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)
Jingjin Yu, S. LaValle (2013)
Structure and Intractability of Optimal Multi-Robot Path Planning on GraphsProceedings of the AAAI Conference on Artificial Intelligence
J. Berg, S. Guy, M. Lin, Dinesh Manocha (2011)
Reciprocal n-Body Collision Avoidance
Pavel Surynek (2011)
Multi-Robot Path Planning
Renato Farias, Marcelo Kallmann (2020)
Optimal Path Maps on the GPUIEEE Transactions on Visualization and Computer Graphics, 26
One main challenge in multi-agent navigation is to generate trajectories minimizing bottlenecks in environments cluttered with obstacles. In this paper we approach this problem globally by taking into account the maximum flow capacity of a given polygonal environment. Given the difficulty in solving the continuous maximum flow of a planar environment, we present in this paper a GPU-based methodology which leads to practical methods for computing maximum flow maps in arbitrary two-dimensional polygonal domains. Once a flow map representation is obtained, lanes can be extracted and optimized in length while keeping constant the flow capacity achieved by the system of trajectories. This work extends our previous work on max flow maps by presenting a clearance-based flow generation method which takes into account the size of the agents at the flow generation phase. In this way we ensure that the maximum possible number of lanes with the needed clearance is always obtained, a property that was found to not be always obtained with our previous method. As a result we are able to generate trajectories of maximum flow from source to sink edges across a generic set of polygonal obstacles, enabling the deployment of large numbers of agents utilizing the maximum flow capacity of a continuous description of the environment and eliminating bottlenecks.
Autonomous Robots – Springer Journals
Published: Sep 17, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.