Ariel Felner, Roni Stern, Sarit Kraus  Home/Search
Context
Related
| umd.edu/users/sarit/./Ar...pha_aamas.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umd.edu/users/sarit/conference (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 twolevel 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... (Update)
Similar documents (at the sentence level):
11.0%: PHA*: Finding the Shortest Path with A* in an Unknown.. - Felner, Stern, al. (2004) (Correct)
Active bibliography (related documents): More All
0.1: The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1995) (Correct)
0.1: Utility-based On-Line Exploration for Repeated.. - Argamon-Engelson.. (Correct)
0.1: Interleaved vs. A Priori Exploration for Repeated.. - Argamon-Engelson.. (Correct)
Similar documents based on text: More All
0.3: KBFS: K-Best-First Search - Felner, Kraus (Correct)
0.3: Progressive Hedging In Parallel - Michael Somervell Department (1998) (Correct)
0.3: Compressing Pattern Databases - Ariel Felner And (Correct)
BibTeX entry: (Update)
@misc{ felner-pha,
author = "Ariel Felner and Roni Stern and Sarit Kraus",
title = "PHA*: Performing A* in Unknown Physical Environments",
url = "citeseer.ist.psu.edu/593040.html" }
Citations (may not include all citations):354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
168 Real-time heuristic search (context) - Korf - 1990
159 Spatial Tessellations: Concepts and Applications of Voronoi .. (context) - Okabe, Boots et al. - 1992
158 A formal basis for the heuristic determination of minimum co.. (context) - Hart, Nilsson et al. - 1968
91 The quickhull algorithm for convex hull - Barber, Dobkin et al. - 1996
61 Quarterly of Applied Mathematics (context) - Bellman, problem - 1958
42 Generalized best-first search strategies and the optimality (context) - Dechter, Pearl - 1985
38 Optimal and efficient path planning for partially known envi.. - Stentz - 1994
26 The power of a pebble: Exploring and mapping directed graphs - Bender, Fernandez et al. - 1998
17 Are many reactive agents better than a few deliberative ones (context) - Knight - 1993
8 Learning in navigation: Goal finding in graphs (context) - Cucka, Netanyahu et al. - 1996
1 Organizatonal strategies for multiagent real-time search (context) - Kitamura, Teranishi et al. - 1996
1 Optimal path search in unknown physical enviroments (context) - Stern - 2001
1 Studies in semi-admissible heursitics (context) - Pearl, Kim - 1982
1 an algorithm for minimizing travel effort in sensor based mo.. (context) - Shmoulian, Rimon
Documents on the same site (http://www.umiacs.umd.edu/users/sarit/conference.html): More
Negotiation on Data Allocation in Multi-Agent Environments - Schwartz, Kraus (1997) (Correct)
Coalition Formation with Uncertain Heterogeneous Information - Kraus, Shehory (2003) (Correct)
An Automated Negotiator for an International Crisis - Penina Hoz-Weiss Sarit (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC