Agent-based coordination of human-multirobot teams in complex environments

作者: Jeanine Ayers , Nathan Schurr , Jeff Rousseau , Alan Carlin

DOI: 10.5555/1838194.1838204

关键词:

摘要: Room clearing, in which building surveillance is conducted to search for criminals, continues be a dangerous and difficult problem urban settings, both the military as well police. In typical setting, an unknown number of hostile forces may located building, they armed. Furthermore, there innocent civilians. The goal friendly units enter room secure it, but without loss life forces, most especially It would beneficial allow robots part team, however it very challenging have that do not either slow down or obstruct their human teammate. This since nearly all use by police today are tele-operated. this paper, we describe work developed cooperation with army, clearing domain. We constructed algorithm whereby multiple agents, form robots, can accomplish task. augmented agent algorithms introduce Adjustable Autonomy, allowing humans. simulated results on maps, furthermore how intend next conduct hardware tests, eventual plans field system. agent-based solution has great potential increase acceptance leverage robotics complex environments.

参考文章(11)
Janusz Marecki, Nathan Schurr, Milind Tambe, Improving adjustable autonomy strategies for time-critical domains adaptive agents and multi agents systems. pp. 353- 360 ,(2009)
Richard Borie, Sven Koenig, Craig Tovey, Algorithms and complexity results for pursuit-evasion problems international joint conference on artificial intelligence. pp. 59- 66 ,(2009)
Brian P. Gerkey, Sebastian Thrun, Geoff Gordon, Visibility-based pursuit-evasion with limited field of view national conference on artificial intelligence. pp. 20- 27 ,(2004)
Craig Boutilier, Planning, Learning and Coordination in Multiagent Decision Processes theoretical aspects of rationality and knowledge. pp. 195- 210 ,(1996)
Damien Pellier, Humbert Fiorino, Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem adaptive agents and multi-agents systems. pp. 895- 902 ,(2005) , 10.1145/1082473.1082609
Andrea S. LaPaugh, Recontamination does not help to search a graph Journal of the ACM. ,vol. 40, pp. 224- 245 ,(1993) , 10.1145/151261.151263
D Bienstock, Paul Seymour, Monotonicity in graph searching Journal of Algorithms. ,vol. 12, pp. 239- 245 ,(1991) , 10.1016/0196-6774(91)90003-H
Volkan Isler, Sampath Kannan, Sanjeev Khanna, Randomized Pursuit-Evasion with Local Visibility SIAM Journal on Discrete Mathematics. ,vol. 20, pp. 26- 41 ,(2006) , 10.1137/S0895480104442169
Ichiro Suzuki, Masafumi Yamashita, Searching for a mobile intruder in a polygonal region SIAM Journal on Computing. ,vol. 21, pp. 863- 888 ,(1992) , 10.1137/0221051
JAE-HA LEE, SANG-MIN PARK, KYUNG-YONG CHWA, SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER International Journal of Computational Geometry and Applications. ,vol. 10, pp. 201- 220 ,(2000) , 10.1142/S0218195900000127