DocumentCode
2267379
Title
Robust coordination for large sets of simple rovers
Author
Turner, Kimberly ; Agogino, Adrian
Author_Institution
NASA Ames Res. Center
fYear
0
fDate
0-0 0
Abstract
The ability to coordinate sets of rovers in an unknown environment is critical to the long-term success of many of NASA\´s exploration missions. Such coordination policies must have the ability to adapt in unmodeled or partially modeled domains and must be robust against environmental noise and rover failures. In addition such coordination policies must accommodate a large number of rovers, without excessive and burdensome hand-tuning. In this paper we present a distributed coordination method that addresses these issues in the domain of controlling a set of simple rovers. The application of these methods allows reliable and efficient robotic exploration in dangerous, dynamic, and previously unexplored domains. Most control policies for space missions are directly programmed by engineers or created through the use of planning tools, and are appropriate for single rover missions or missions requiring the coordination of a small number of rovers. Such methods typically require significant amounts of domain knowledge, and are difficult to scale to large numbers of rovers. The method described in this article aims to address cases where a large number of rovers need to coordinate to solve a complex time dependent problem in a noisy environment. In this approach, each rover decomposes a global utility, representing the overall goal of the system, into rover-specific utilities that properly assign credit to the rover\´s actions. Each rover then has the responsibility to create a control policy that maximizes its own rover-specific utility. We show a method of creating rover-utilities that are "aligned" with the global utility, such that when the rovers maximize their own utility, they also maximize the global utility. In addition we show that our method creates rover-utilities that allow the rovers to create their control policies quickly and reliably. Our distributed learning method allows large sets rovers be used unmodeled domains, while providing robustness against ro- - ver failures and changing environments. In experimental simulations we show that our method scales well with large numbers of rovers in addition to being robust against noisy sensor inputs and noisy servo control. The results show that our method is able to scale to large numbers of rovers and achieves up to 400% performance improvement over standard machine learning methods
Keywords
distributed control; learning (artificial intelligence); planetary rovers; robust control; NASA exploration missions; complex time dependent problem; control policies; coordination policies; distributed coordination method; domain knowledge; environmental noise; global utility; noisy environment; noisy sensor inputs; noisy servo control; robotic exploration; robust coordination; robustness; rover failures; rover-specific utilities; rovers; space missions; standard machine learning methods; Control systems; Learning systems; Legged locomotion; Machine learning algorithms; NASA; Orbital robotics; Robot kinematics; Robust control; Robustness; Working environment noise;
fLanguage
English
Publisher
ieee
Conference_Titel
Aerospace Conference, 2006 IEEE
Conference_Location
Big Sky, MT
Print_ISBN
0-7803-9545-X
Type
conf
DOI
10.1109/AERO.2006.1655804
Filename
1655804
Link To Document