DocumentCode :
251291
Title :
Online pickup and delivery planning with transfers for mobile robots
Author :
Coltin, Brian ; Veloso, Marco
Author_Institution :
Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear :
2014
fDate :
May 31 2014-June 7 2014
Firstpage :
5786
Lastpage :
5791
Abstract :
We have deployed a fleet of robots that pickup and deliver items requested by users in an office building. Users specify time windows in which the items should be picked up and delivered, and send in requests online. Our goal is to form a schedule which picks up and delivers the items as quickly as possible at the lowest cost. We introduce an auction-based scheduling algorithm which plans to transfer items between robots to make deliveries more efficiently. The algorithm can obey either hard or soft time constraints. We discuss how to replan in response to newly requested items, cancelled requests, delayed robots, and robot failures. We demonstrate the effectiveness of our approach through execution on robots, and examine the effect of transfers on large simulated problems.
Keywords :
mobile robots; planning (artificial intelligence); scheduling; auction-based scheduling algorithm; delivery planning; delivery schedule; mobile robots; office building; online pickup; picks up schedule; Buildings; Robots; Schedules; Servers; Time factors; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics and Automation (ICRA), 2014 IEEE International Conference on
Conference_Location :
Hong Kong
Type :
conf
DOI :
10.1109/ICRA.2014.6907709
Filename :
6907709
Link To Document :
بازگشت