Path planning for altruistically negotiating processes

Authors:
Deepthi Devalarazu;Daniel W. Watson
Affiliations:
Department of Computer Science, Utah State University, Logan, Utah;Department of Computer Science, Utah State University, Logan, Utah
Venue:
CTS'05 Proceedings of the 2005 international conference on Collaborative technologies and systems
Year:
2005

Citing 5
Cited 0

General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
Kinodynamic motion planning

Journal of the ACM (JACM)
Robot Motion Planning

Robot Motion Planning
Planning Algorithms

Planning Algorithms
Complexity of the mover's problem and generalizations

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Autonomous Negotiating Systems are composed of logically (even geographically) separated software agents that control logical or physical resources that altruistically seek to perform useful work in a cooperative manner. These systems are Multi-Agent systems that consist of a population of autonomous agents collaborating to work for a common goal while simultaneously performing their individual tasks (i.e., computational resources are distributed amongst interconnected agents). With the increasing capabilities of the collaborative agents, the need for faster and more efficient methods of utilizing the distributed resources has also increased. This paper focuses on improving the performance of one such multi-agent system that deals with the path planning for autonomous robots. This is achieved by exploiting parallelism among processing resources embedded in the autonomous vehicles, using a distributed memory, message-passing execution model.