Propagating Updates in Real-Time Search: HLRTA*(k). - Carlos Hernández 003; Pedro Meseguer (CAEPIA, 2005)

LRTA*(k). - Carlos Hernández 003; Pedro Meseguer (IJCAI, 2005)

Propagating updates in real-time search: FALCONS(k). - Carlos Hernández 003; Pedro Meseguer (SCCC, 2005)

Improving HLRTA*( k ). - Carlos Hernández 003; Pedro Meseguer (CAEPIA, 2007)

Improving LRTA*(k). - Carlos Hernández 003; Pedro Meseguer (IJCAI, 2007)

Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. - Carlos Hernández 003; Pedro Meseguer; Xiaoxun Sun; Sven Koenig (ICAPS, 2009)

Escaping Heuristic Hollows in Real-Time Search without Learning. - Carlos Hernández 003; Jorge A. Baier (SCCC, 2010)

Fast Subgoaling for Pathfinding via Real-Time Search. - Carlos Hernández 003; Jorge A. Baier (ICAPS, 2011)

Escaping heuristic depressions in real-time heuristic search. - Carlos Hernández 003; Jorge A. Baier (AAMAS, 2011)

Tree Adaptive A. - Carlos Hernández 003; Xiaoxun Sun; Sven Koenig; Pedro Meseguer (AAMAS, 2011)

Real-Time Heuristic Search with Depression Avoidance. - Carlos Hernández 003; Jorge A. Baier (IJCAI, 2011)

Real-Time Adaptive A* with Depression Avoidance. - Carlos Hernández 003; Jorge A. Baier (SOCS, 2011)

Time-bounded adaptive A. - Carlos Hernández 003; Jorge A. Baier; Tansel Uras; Sven Koenig (AAMAS, 2012)

Position Paper: Incremental Search Algorithms Considered Poorly Understood. - Carlos Hernández 003; Jorge A. Baier; Tansel Uras; Sven Koenig (SOCS, 2012)

Paper Summary: Time-Bounded Adaptive A. - Carlos Hernández 003; Jorge A. Baier; Tansel Uras; Sven Koenig (SOCS, 2012)

Subgoal Graphs for Eight-Neighbor Gridworlds. - Tansel Uras; Sven Koenig; Carlos Hernández 003 (SOCS, 2012)

Avoiding and Escaping Depressions in Real-Time Heuristic Search. - Carlos Hernández 003; Jorge A. Baier (J. Artif. Intell. Res., 2012)

Moving Target Search with Compressed Path Databases. - Adi Botea; Jorge A. Baier; Daniel Harabor; Carlos Hernández 003 (ICAPS, 2013)

Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids. - Tansel Uras; Sven Koenig; Carlos Hernández 003 (ICAPS, 2013)

Weighted real-time heuristic search. - Nicolas Rivera; Jorge A. Baier; Carlos Hernández 003 (AAMAS, 2013)

Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search. - Nicolas Rivera; Leon Illanes; Jorge A. Baier; Carlos Hernández 003 (SOCS, 2013)

Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain. - Carlos Hernández 003; Jorge A. Baier; Roberto Asín (ICAPS, 2014)

Time-Bounded Best-First Search. - Carlos Hernández 003; Roberto Asín; Jorge A. Baier (SOCS, 2014)

Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound. - Carlos Hernández 003; Jorge A. Baier (SOCS, 2014)

Reconnection with the Ideal Tree: A New Approach to Real-Time Search. - Nicolas Rivera; Leon Illanes; Jorge A. Baier; Carlos Hernández 003 (J. Artif. Intell. Res., 2014)

Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain. - Carlos Hernández 003; Roberto Asín; Jorge A. Baier (AAAI, 2015)

Reusing cost-minimal paths for goal-directed navigation in partially known terrains. - Carlos Hernández 003; Tansel Uras; Sven Koenig; Jorge A. Baier; Xiaoxun Sun; Pedro Meseguer (Auton. Agents Multi Agent Syst., 2015)

Incorporating weights into real-time heuristic search. - Nicolas Rivera; Jorge A. Baier; Carlos Hernández 003 (Artif. Intell., 2015)

Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. - Jorge A. Baier; Adi Botea; Daniel Harabor; Carlos Hernández 003 (IEEE Trans. Comput. Intell. AI Games, 2015)

Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs. - Carlos Hernández 003; Jorge A. Baier; Roberto Asín (J. Artif. Intell. Res., 2016)

Grid Pathfinding on the 2k Neighborhoods. - Nicolas Rivera; Carlos Hernández 003; Jorge A. Baier (AAAI, 2017)

Improving MPGAA* for Extended Visibility Ranges. - Carlos Hernández 003; Jorge A. Baier (ICAPS, 2017)

Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads. - Carlos Hernández 003; Adi Botea; Jorge A. Baier; Vadim Bulitko (IJCAI, 2017)

Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods. - Nicolás Hormazábal; Antonio Díaz; Carlos Hernández 003; Jorge A. Baier (SOCS, 2017)

Multi-Agent Pathfinding with Real-Time Heuristic Search. - Devon Sigurdson; Vadim Bulitko; William Yeoh 001; Carlos Hernández 003; Sven Koenig (CIG, 2018)

Anytime Focal Search with Applications. - Liron Cohen 002; Matias Greco; Hang Ma 001; Carlos Hernández 003; Ariel Felner; T. K. Satish Kumar; Sven Koenig (IJCAI, 2018)

A Suboptimality Bound for 2k Grid Path Planning. - Benjamín Kramm; Nicolas Rivera; Carlos Hernández 003; Jorge A. Baier (SOCS, 2018)

A Neural Network for Decision Making in Real-Time Heuristic Search. - Franco Muñoz; Miguel Fadic; Carlos Hernández 003; Jorge A. Baier (SOCS, 2018)

Compiling Cost-Optimal Multi-Agent Pathfinding to ASP. - Rodrigo N. Gómez; Carlos Hernández 003; Jorge A. Baier (SOCS, 2019)

A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results. - Carlos Hernández Ulloa; Jorge A. Baier; William Yeoh 001; Vadim Bulitko; Sven Koenig (SOCS, 2019)

Automatic Algorithm Selection In Multi-agent Pathfinding. - Devon Sigurdson; Vadim Bulitko; Sven Koenig; Carlos Hernández 003; William Yeoh 001 (CoRR, 2019)

Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming. - Rodrigo N. Gómez; Carlos Hernández 003; Jorge A. Baier (AAAI, 2020)

Heuristic Function to Solve The Generalized Covering TSP with Artificial Intelligence Search. - Matias Greco; Carlos Hernández 003 (SCCC, 2020)

A Simple and Fast Bi-Objective Search Algorithm. - Carlos Hernández Ulloa; William Yeoh 001; Jorge A. Baier; Luis Suazo; Han Zhang 018; Sven Koenig (SOCS, 2020)

Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain. - Carlos Hernández Ulloa; Jorge A. Baier; Roberto Javier Asín Achá (IEEE Access, 2020)

The 2^k Neighborhoods for Grid Path Planning. - Nicolás Rivera; Carlos Hernández 003; Nicolás Hormazábal; Jorge A. Baier (J. Artif. Intell. Res., 2020)

A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding. - Rodrigo N. Gómez; Carlos Hernández 003; Jorge A. Baier (IEEE Access, 2021)

Subset Approximation of Pareto Regions with Bi-objective A. - Nicolás Rivera; Jorge A. Baier; Carlos Hernández 003 (AAAI, 2022)

A*pex: Efficient Approximate Multi-Objective Search on Graphs. - Han Zhang 018; Oren Salzman; T. K. Satish Kumar; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig (ICAPS, 2022)

Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract). - Jorge A. Baier; Nicolás Rivera; Carlos Hernández Ulloa (SOCS, 2022)

K-Focal Search for Slow Learned Heuristics (Extended Abstract). - Matias Greco; Jorge Toro; Carlos Hernández Ulloa; Jorge A. Baier (SOCS, 2022)

Bounded-Cost Bi-Objective Heuristic Search. - Shawn Skyler; Dor Atzmon; Ariel Felner; Oren Salzman; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (SOCS, 2022)

Anytime Approximate Bi-Objective Search. - Han Zhang 018; Oren Salzman; T. K. Satish Kumar; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2022)

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Carlos Hernández Ulloa; Sven Koenig (ICAPS, 2023)

Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. - Oren Salzman; Ariel Felner; Carlos Hernández 003; Han Zhang 018; Shao-Hung Chan; Sven Koenig (IJCAI, 2023)

Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. - Shawn Skyler; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner; Oren Salzman; Shao-Hung Chan; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (SOCS, 2023)

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Shawn Skyler; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2023)

Simple and efficient bi-objective search algorithms via fast dominance checks. - Carlos Hernández 003; William Yeoh 001; Jorge A. Baier; Han Zhang 018; Luis Suazo; Sven Koenig; Oren Salzman (Artif. Intell., 2023)

Theoretical Study on Multi-objective Heuristic Search. - Shawn Skyler; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner; Oren Salzman; Shao-Hung Chan; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (IJCAI, 2024)

Toward Automatic Vehicle Classification for Toll Booths on Chilean Interurban Highways. - Victor Flores; Raúl Luengo; Carlos Hernández Ulloa; Billy Peralta (SCCC, 2024)

Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2024)

A-A*pex: Efficient Anytime Approximate Multi-Objective Search. - Han Zhang 018; Oren Salzman; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2024)

Finding a Small, Diverse Subset of the Pareto Solution Set in Bi-Objective Search (Extended Abstract). - Pablo Araneda; Carlos Hernández Ulloa; Nicolás Rivera; Jorge A. Baier (SOCS, 2024)

Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. - Carlos Hernández Ulloa; Han Zhang 018; Sven Koenig; Ariel Felner; Oren Salzman (SOCS, 2024)

K-Focal Search for Slow Learned Heuristics. - Matias Greco; Jorge Toro; Carlos Hernández 003; Jorge A. Baier (IEEE Access, 2024)

EMOA*: A framework for search-based multi-objective path planning. - Zhongqiang Ren; Carlos Hernández 003; Maxim Likhachev; Ariel Felner; Sven Koenig; Oren Salzman; Sivakumar Rathinam; Howie Choset (Artif. Intell., 2025)