Priority-Constrained Task Sequencing for Heterogeneous Mobile Robots
This paper presents an application of a technique for sequencing priority-constrained tasks which will be performed autonomously by a couple of heterogeneous mobile robots. Here the sequencing problem of sequentially-performed and separate tasks for multiple robots is considered. Two types of tasks are chosen. One type of tasks can be performed by only one robot. The second type of task requires completion of a part of the task by one robot and the rest of the task is completed by another robot due to nature of the tasks and abilities of the robots. It is assumed that tasks have been assigned to the robots, completion times and priorities of the tasks for each robot has been determined beforehand. In this paper, a technique is used for sequencing the tasks to produce a schedule with a minimum makespan. Real world experiments are presented to show the convenience of the proposed approach.
KeywordsSchedule Problem Completion Time Mobile Robot Schedule Algorithm Flow Shop
Unable to display preview. Download preview PDF.
- 2.Dahl, T.S., Mataric, M.J., Sukhatme, G.S.: Scheduling with Group Dynamics: A Multi-Robot Task Allocation Algorithm Based on Vacancy Chains. Technical Report CRES-002-07, Center for Robotics and Embedded Systems, University of Southern California (2002)Google Scholar
- 5.Sule, D.R.: Industrial Scheduling. PWS Publishing (1997)Google Scholar
- 7.Johnson, L.A., Montgomery, D.C.: Operations Research in Production Planning, Scheduling and Inventory Control. John Wiley & Sons Inc., USA (1974)Google Scholar