ACM Home Page
Please provide us with feedback. Feedback
The PIM: an innovative robot coordination model based on Java thread migration
Full text PdfPdf (3.81 MB)
Source
ACM International Conference Proceeding Series; Vol. 347 archive
Proceedings of the 6th international symposium on Principles and practice of programming in Java table of contents
Modena, Italy
SESSION: Software engineering issues in Java program design table of contents
Pages 43-51  
Year of Publication: 2008
ISBN:978-1-60558-223-8
Authors
Raffaele Quitadamo  University of Modena and Reggio Emilia, Modena, Italy
Danilo Ansaloni  University of Modena and Reggio Emilia, Modena, Italy
Niranjan Suri  Institute for Human and Machine Cognition, Pensacola, Florida, United States
Kenneth M. Ford  Institute for Human and Machine Cognition, Pensacola, Florida, United States
James Allen  Institute for Human and Machine Cognition, Pensacola, Florida, United States
Giacomo Cabri  University of Modena and Reggio Emilia, Modena, Italy
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 51,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1411732.1411739
What is a DOI?

ABSTRACT

There is a growing demand to apply multi-robot systems to address many current problems ranging from search and rescue to distributed surveillance to coordination of small satellites in space. Solving these problems effectively requires that teams of robots coordinate effectively. Many of the algorithms for coordination are based on the so-called centralized paradigm, where a central controlling authority is responsible for coordinating the entire team of robots. Unfortunately, centralized approaches often fall short when dealing with rapidly changing situations, unreliability of communications, and failure of robots, especially in hostile environments. Distributed approaches, in an effort to address such issues, tend to introduce complex negotiation or market-based strategies for distributed task execution, sometimes resulting in cumbersome programming models and suboptimal solutions. In this paper, we introduce the readers to the PIM (Process Integrated Mechanism) approach to multi-robot coordination grounded in research on Java thread migration. The core idea of the PIM is to retain the perspective of the single controlling authority but abandon the notion that it must have a fixed location within the system. Instead, the single coordinating thread is rapidly moved among the team members. The PIM leverages on Java thread mobility to preserve the optimality of the centralized approach, while effectively addressing most of its weaknesses (e.g. sluggish response to dynamic conditions, communication difficulties, and a single point of failure). A prototype implementation of such a model is presented on top of the Mobile JikesRVM framework for Java thread migration, along with some preliminary performance results.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
ANU - Department of Computer Science. (2008). DaCapo Benchmark regression tests. Retrieved 2008, from http://jikesrvm.anu.edu.au/~dacapo/index.php?category=rele ase
 
4
Brummit, B., & Stentz, A. (1996). Dynamic Mission Planning for Multiple Mobile Robots. IEEE International Conference on Robotics and Automation. IEEE, pp. 2396--2401.
5
 
6
Cabri, G., Leonardi, L., & Zambonelli, F. (2000). Weak and Strong Mobility in mobile agents applications. 2nd International Conference and Exhibition on The Practical Application of Java.
 
7
Caloud, P., Choi, W., Latombe, J.-C., Pape, C. L., & Yim, M. (1990). Indoor automation with many mobile robots. Intelligent Robots and Systems '90. 'Towards a New Frontier of Applications', Proceedings. IROS '90. IEEE International Workshop on, pp. 67--72, vol.1.
 
8
Chaimowicz, L., Sugar, T., Kumar, V., & Campos, M. (2001). An architecture for tightly coupled multi-robot cooperation. Robotics and Automation, 2001. Proceedings 2001 ICRA. IEEE International Conference on, pp. 2992--2997, vol.3.
 
9
Dias, M., & Stentz, A. (2003). A comparative study between centralized, market-based, and behavioral multirobot coordination approaches. Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings. 2003 IEEE/RSJ International Conference on, pp. 2279--2284, vol.3.
 
10
Dias, M., & Stentz, A. (2001). A Market Approach to Multirobot Coordination.
 
11
Ford, K., Suri, N., Kosnar, K., Jisl, P., Benda, P., Pechoucek, M., et al. (2008). A Game-based Approach to Comparing Different Coordination Mechanisms. IEEE International Conference on Distributed Human-Machine Systems (DHMS). IEEE, pp. 20--25.
 
12
 
13
Gerkey, B. P., & Mataric, M. J. (2002). Sold!: Auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation, 18, pp. 758--768.
 
14
Golfarelli, M., Maio, D., & Rizzi, S. (1997). A Task-Swap Negotiation Protocol Based on the Contract Net Paradigm.
 
15
Jensen, R. M., & Veloso, M. M. (1999). OBDD-Based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains. Lecture Notes in Computer Science, vol. 1600, pp. 213--248.
 
16
Mataric, M. (1995). Issues and approaches in the design of collective autonomous agents. Robotics and Autonomous Systems, 16, 321--331.
 
17
Microsystems, Sun. (2001). Object Serialization. Retrieved 2008, from http://java.sun.com/j2se/1.4.2/docs/guide/serialization/index.html
 
18
Mobile Robots Inc. (2008). MobileSim. Retrieved 2008, from http://robots.mobilerobots.com/MobileSim/
 
19
 
20
Parker, L. (1998). ALLIANCE: an architecture for fault tolerant multirobot cooperation. Robotics and Automation, IEEE Transactions on, vol. 14, pp. 220--240.
 
21
Parker, L. (1993). Designing control laws for cooperative agent teams. Robotics and Automation, 1993. Proceedings., 1993 IEEE International Conference on, pp. 582--587, vol.3.
 
22
 
23
Robocup Official Site. (2008). Retrieved 2008, from http://www.robocup.org/
 
24
 
25
 
26
Suri, N., Rebeschini, M., Arguedas, M., Carvalho, M., Stabellini, S., & Breedy, M. (2007). Towards an Agile Computing Approach to Dynamic and Adaptive Service-Oriented Architectures. First IEEE Workshop on Autonomic Communication and Network Management (ACNM'07), pp. 25--31.
 
27
Suri, N., Rebeschini, M., Breedy, M., Carvalho, M., & Arguedas, M. (2006). Resource and Service Discovery in Wireless Ad-Hoc Networks with Agile Computing. IEEE Military Communications Conference (MILCOM 2006). IEEE, pp. 1--7.
 
28
Svestka, P., & Overmars, M. (1998). Coordinated path planning for multiple robots. Robotics and Autonomous Systems, 23 (3), pp. 125--152.
 
29
Tambe, M., Pynadath, D., Chauvat, N., Das, A., & Kaminka, G. (2000). Adaptive agent integration architectures for heterogeneous team members. Adaptive agent integration architectures for heterogeneous team members, p. 301.
 
30
Veloso, M., Stone, P., & Bowling, M. (1998). Anticipation: A Key for Collaboration in a Team of Agents. Anticipation: A Key for Collaboration in a Team of Agents, pp. 1--16.

Collaborative Colleagues:
Raffaele Quitadamo: colleagues
Danilo Ansaloni: colleagues
Niranjan Suri: colleagues
Kenneth M. Ford: colleagues
James Allen: colleagues
Giacomo Cabri: colleagues