Graph-based multi-robot path finding and planning
H Ma - Current Robotics Reports, 2022 - Springer
Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …
real-world multi-robot systems and has been studied as an optimization problem on graphs …
Automated planning for robotics
Modern robots are increasingly capable of performing “basic” activities such as localization,
navigation, and motion planning. However, for a robot to be considered intelligent, we would …
navigation, and motion planning. However, for a robot to be considered intelligent, we would …
Searching with consistent prioritization for multi-agent path finding
We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …
[HTML][HTML] Robot scheduling for pod retrieval in a robotic mobile fulfillment system
In order to increase the order picking efficiency, e-commerce retailers have started to
implement order picking systems where mobile robots carry inventory pods to pick stations …
implement order picking systems where mobile robots carry inventory pods to pick stations …
Integrated task allocation and path coordination for large-scale robot networks with uncertainties
Artificial intelligence-enhanced autonomous unmanned systems, such as large-scale
autonomous robot networks, are widely used in logistic and industrial applications. In this …
autonomous robot networks, are widely used in logistic and industrial applications. In this …
Path planning of multi-robot systems with boolean specifications based on simulated annealing
In this letter, we address the path planning of multi-robot systems (ie, a team of identical
mobile robots) with a global high-level specification that is given as a Boolean formula over …
mobile robots) with a global high-level specification that is given as a Boolean formula over …
Prediction, planning, and coordination of thousand-warehousing-robot networks with motion and communication uncertainties
In this article, we focus on resolving the traffic flow prediction, robot path planning, and
motion coordination problems in large-scale warehousing robotics systems with thousand …
motion coordination problems in large-scale warehousing robotics systems with thousand …
Multi-agent path finding with deadlines
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to
maximize the number of agents that can reach their given goal vertices from their given start …
maximize the number of agents that can reach their given goal vertices from their given start …
Path planning for robotic teams based on LTL specifications and Petri net models
This research proposes an automatic strategy for planning a team of identical robots
evolving in a known environment. The robots should satisfy a global task for the whole team …
evolving in a known environment. The robots should satisfy a global task for the whole team …
[BOOK][B] Path planning of cooperative mobile robots using discrete event models
Offers an integrated presentation for path planning and motion control of cooperative mobile
robots using discrete-event system principles Generating feasible paths or routes between a …
robots using discrete-event system principles Generating feasible paths or routes between a …