PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment

by   A. Ben-Yair, et al.

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 territory. We introduce the Physical-A* algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes that A* would expand and returns the shortest path between the two points. However, due to the physical nature of the problem, the complexity of the algorithm is measured by the traveling effort of the moving agent and not by the number of generated nodes, as in standard A*. PHA* is presented as a two-level algorithm, such that its high level, A*, chooses the next node to be expanded and its low level directs the agent to that node in order to explore it. We present a number of variations for both the high-level and low-level procedures and evaluate their performance theoretically and experimentally. We show that the travel cost of our best variation is fairly close to the optimal travel cost, assuming that the mandatory nodes of A* are known in advance. We then generalize our algorithm to the multi-agent case, where a number of cooperative agents are designed to solve the problem. Specifically, we provide an experimental implementation for such a system. It should be noted that the problem addressed here is not a navigation problem, but rather a problem of finding the shortest path between two points for future usage.



There are no comments yet.


page 1

page 2

page 3

page 4


Reverse Shortest Path Problem for Unit-Disk Graphs

Given a set P of n points in the plane, a unit-disk graph G_r(P) with re...

A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains

Let P be a polygonal domain of h holes and n vertices. We study the prob...

Scalability of Network Visualisation from a Cognitive Load Perspective

Node-link diagrams are widely used to visualise networks. However, even ...

Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)

Cooperative pathfinding is a problem of finding a set of non-conflicting...

Finding Shortest Path for Developed Cognitive Map Using Medial Axis

this paper presents an enhancement of the medial axis algorithm to be us...

Approximate Time-Optimal Trajectories for Damped Double Integrator in 2D Obstacle Environments under Bounded Inputs

This article provides extensions to existing path-velocity decomposition...

A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks

Given different types of constraints on human life, people must make dec...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.