Utility-based multi-agent system for performing repeated navigation tasks

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2005, Pages 1021-1028

  Meshulam, Ram ^a   Felner, Ariel ^b   Kraus, Sarit ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Applications of autonomous agents multi agent systems; Mobile agents

Indexed keywords

AUTONOMOUS AGENTS; GRAPH THEORY; MOTION PLANNING; NAVIGATION; RANDOM PROCESSES;

APPLICATIONS OF AUTONOMOUS AGENTS; MOBILE AGENTS; STOCHASTIC GREEDY MULTI-AGENT SYSTEM;

MULTI AGENT SYSTEMS;

EID: 33644797765     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. S. Argamon-Engelson, S. Kraus, and S. Sina. Utility-based on-line exploration for repeated navigation in an embedded graph. Artificial Intelligence, 101(1-2):267-284, 1998.
2. S. Argamon-Engelson, S. Kraus, and S. Sina. Interleaved versus priori exploration for repeated navigation in a partially-known graph. IJPRAI, 13(7):963-896, 1999.
3. M. A. Bender, A. Fernandez, D. Ron, A. Sahai, and S. P. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 269-278, May 1998.
4. P. Cucka, N. S. Netanyahu, and A. Rosenfeld. Learning in navigation: Goal finding in graphs. International Journal of Pattern Recognition and Artificial Intelligence, 10(5):429-446, 1996.
5. A. Felner, R. Stern, A. Ben-Yair, S. Kraus, and N. Netanyahu. PHA*: Finding the shortest path with A* in unknown physical environments. Journal of Artificial Intelligence Research, 21:631-679, 2004.
6. L. Finkelstein, S. Markovitch, and E. Rivlin. Optimal schedules for parallelizing anytime algorithms: the case of independent processes. In Proc. AAAI-02, pages 719-724, 2002.
7. Y. K. Hwang and N. Ahuja. Gross motion planning -a survey. ACM Comput. Surv., 24(3):219-291, 1992.
8. R. E. Korf. Real-time heuristic search. Artificial Intelligence, 42(3):189-211, 1990.
9. S. Russell and P. Norvig. Artificial Intelligence, A Modern Approach. Prentice Hall, 2002.
10. L. Shmoulian and E. Rimon. Roadmap-A*: An algorithm for minimizing travel effort in sensor based mobile robot navigation. In Proc. ICRA, pages 356-362, Leuven, Belgium, May 1998.
11. Y. Shoham and S. Toledo. Parallel randomized best-first minimax search. Artif. Intell., 137(1-2):165-196, 2002.
12. A. Stentz. Optimal and efficient path planning for partially-known environments. In Proc. ICRA, pages 3310-3317, San Diego, CA, May 1994.