OMCoRP: An Online Mechanism for Competitive Robot Prioritization
| Multi-Robot System Collision Avoidance Mechanism Design |
PaperID: 99
pdf
poster
|
| We propose a collision-avoiding mechanism for a group of robots moving on a shared workspace. Existing algorithms solve this problem either (a) in an offline manner using the source-destination information of all the robots or (b) in an online manner with cooperative robots. We take a paradigm shift to the setting with competitive robots, that may strategically reveal their urgency of reaching the destinations and design online mechanisms that take decisions on-the-fly, reducing the overhead of an offline planning. We propose a mechanism OMCoRP in this setting that ensures truthful revelation of the robots' priorities using principles of economic theory and provides locally efficient movement of the robots. It is free from collisions and deadlocks, and handles dynamic arrival of robots. In practice, this mechanism gives a smaller delay for robots of higher priority and scales well for a large number of robots without compromising on the path optimality too much. | |
Session 1: Search
Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier
Authors: Oren Salzman and Boris Goldin
Keywords:
Bicriteria searchPareto frontierApproximate search
Conflict-Free Multi-Agent Meeting
Authors: Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman and Ariel Felner
Keywords:
Conflict-Free Multi-Agent MeetingMulti-Agent MeetingMulti-Agent Path FindingIterative Meeting SearchMulti-Directional Heuristic SearchConflict-FreeConstraintMAMMAPFCF-MAPF
OMCoRP: An Online Mechanism for Competitive Robot Prioritization
Authors: Sankar Das, Swaprava Nath and Indranil Saha
Keywords:
Multi-Robot SystemCollision AvoidanceMechanism Design
Safe Multi-Agent Pathfinding with Time Uncertainty
Authors: Tomer Shahar, Shashank Shekhar, Dor Atzmon, Abdallah Saffidine, Brendan Juba and Roni Stern