Distributed mutual exclusion based on dynamic costs
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An extended version of distributed mutual exclusion on resources of capacity 1 for a distributed robotic system of N robots is discussed in the context of serving an event that may occur anywhere in the field of operation. The right to serve the event is treated as the resource. A dynamic, time-varying cost, with respect to the resource, is associated with each mobile robot. The author presents two algorithms for distributed mutual exclusion based on an abstracted time-varying cost. Both algorithms guarantee that exactly one robot that eventually arrives at the event scene and serves the event. These algorithms are free from starvation and deadlock.Keywords
This publication has 7 references indexed in Scilit:
- Structure decision method for self organising robots based on cell structures-CEBOTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Theoretical problems for the realization of distributed robotic systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Communication in the autonomous and decentralized robot system ACTRESSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Consideration on the cooperation of multiple autonomous mobile robotsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The mutual exclusion problemJournal of the ACM, 1986
- The mutual exclusion problemJournal of the ACM, 1986
- A robust layered control system for a mobile robotIEEE Journal on Robotics and Automation, 1986