PHA*: Performing A* in unknown physical environments

Ariel Felner, Roni Stern, Sarit Kraus

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

We address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territories. We present the Physical-A* algorithm (PHA*) to solve such a problem. PHA* is a two-level algorithm in which the upper level is A*, which chooses the next node to expand and the lower level directs the agent to that node in order to explore it. The complexity of this algorithm is measured by the traveling effort of the moving agent and not by the number of generated nodes as in classical A*. We present a number of variations of both the upper level and lower level algorithms and compare them both experimentally and theoretically. We then generalize our algorithm to the multi-agent case where a number of cooperative agents are designed to solve this problem and show experimental implementation for such a system.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Autonomous Agents
PublisherAssociation for Computing Machinery (ACM)
Pages240-247
Number of pages8
Edition2
ISBN (Print)9781581134803
StatePublished - 1 Jan 2002
Externally publishedYes
EventProceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2002 - Bologna, Italy
Duration: 15 Jul 200219 Jul 2002

Publication series

NameProceedings of the International Conference on Autonomous Agents
Number2

Conference

ConferenceProceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2002
Country/TerritoryItaly
CityBologna
Period15/07/0219/07/02

Keywords

  • A*
  • Mobile agents
  • Search
  • Shortest path

ASJC Scopus subject areas

  • General Engineering

Cite this