Skip to main content

Priority-Constrained Task Sequencing for Heterogeneous Mobile Robots

  • Conference paper
Advances in Applied Artificial Intelligence (IEA/AIE 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4031))

  • 1573 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arai, T., Pagello, E., Parker, L.E.: Guest Editorial Advances in Multirobot Systems. IEEE Trans. on Robotics and Automation 18(5), 655–661 (2002)

    Article  Google Scholar 

  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 

  3. Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  4. Pinedo, M.: Scheduling Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (2002)

    MATH  Google Scholar 

  5. Sule, D.R.: Industrial Scheduling. PWS Publishing (1997)

    Google Scholar 

  6. Johnson, S.M.: Optimal Two-and Three-Stages Production Schedules with Setup Times Included. Naval Research Logistics Quarterly 1(1), 61–68 (1954)

    Article  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ozkan, M., Saricicek, I., Parlaktuna, O., Hasgul, S. (2006). Priority-Constrained Task Sequencing for Heterogeneous Mobile Robots. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_43

Download citation

  • DOI: https://doi.org/10.1007/11779568_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35453-6

  • Online ISBN: 978-3-540-35454-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics