Escaping Heuristic Hollows in Real-Time Search without Learning

Simple item page
dc.contributor.authorHernández, Carlos
dc.contributor.authorBaier Aranda, Jorge Andrés
dc.date.accessioned2022-05-17T15:57:16Z
dc.date.available2022-05-17T15:57:16Z
dc.date.issued2010
dc.description.abstractReal-time search is a standard approach to solving search problems in which agents have limited sensing capabilities and must act quickly. It is well known that real-time search algorithms like LRTA* and RTA* perform poorly in regions of the search space in which the heuristic function is very imprecise. Approaches that use look ahead or learning are used to overcome this drawback. They perform more computation in the planning phase compared to LRTA* andRTA* . In this paper we propose Path Real-Time A* (PRTA* ), an algorithm that, like LRTA*, performs little computation in the planning phase, but that, unlike LRTA*, terminates even if the problem does not have a solution. We show that our algorithm outperforms LRTA* and RTA* in standard real-time benchmark problems. Furthermore, we show that in some cases, PRTA* may also outperform lookahead-or learning-enabled algorithms but carrying out significantly less computation.
dc.fuente.origenIEEE
dc.identifier.doi10.1109/SCCC.2010.16
dc.identifier.isbn978-1457700736
dc.identifier.issn1522-4902
dc.identifier.urihttps://doi.org/10.1109/SCCC.2010.16
dc.identifier.urihttps://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5750511
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/64048
dc.information.autorucEscuela de ingeniería ; Baier Aranda, Jorge Andrés ; S/I ; 9477
dc.language.isoen
dc.nota.accesoContenido parcial
dc.publisherIEEE
dc.relation.ispartofInternational Conference of the Chilean Computer Science Society (29° : 2010 : Antofagasta, Chile)
dc.rightsacceso restringido
dc.subjectReal time systems
dc.subjectGames
dc.subjectSearch problems
dc.subjectHeuristic algorithms
dc.subjectPlanning
dc.subjectAlgorithm design and analysis
dc.subjectRuntime
dc.titleEscaping Heuristic Hollows in Real-Time Search without Learninges_ES
dc.typecomunicación de congreso
sipa.codpersvinculados9477
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Escaping Heuristic Hollows in Real-Time Search without Learning.pdf
Size:
2.67 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de conferencia