Carlos Hernández

Orcid: 0000-0001-7947-3684

Affiliations:
  • Andrés Bello National University, Santiago, Chile
  • Autonomous University of Barcelona, Spain (former)
  • University of Concepción, Chile (former)


According to our database1, Carlos Hernández authored at least 64 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
K-Focal Search for Slow Learned Heuristics.
IEEE Access, 2024

Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Finding a Small, Diverse Subset of the Pareto Solution Set in Bi-Objective Search (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

A-A*pex: Efficient Anytime Approximate Multi-Objective Search.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Theoretical Study on Multi-objective Heuristic Search.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
Simple and efficient bi-objective search algorithms via fast dominance checks.
Artif. Intell., 2023

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Must-Expand Nodes in Multi-Objective Search [Extended Abstract].
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Anytime Approximate Bi-Objective Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Bounded-Cost Bi-Objective Heuristic Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

K-Focal Search for Slow Learned Heuristics (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

A*pex: Efficient Approximate Multi-Objective Search on Graphs.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Subset Approximation of Pareto Regions with Bi-objective A.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding.
IEEE Access, 2021

2020
The 2^k Neighborhoods for Grid Path Planning.
J. Artif. Intell. Res., 2020

Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain.
IEEE Access, 2020

A Simple and Fast Bi-Objective Search Algorithm.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Heuristic Function to Solve The Generalized Covering TSP with Artificial Intelligence Search.
Proceedings of the 39th International Conference of the Chilean Computer Science Society, 2020

Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Automatic Algorithm Selection In Multi-agent Pathfinding.
CoRR, 2019

A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Compiling Cost-Optimal Multi-Agent Pathfinding to ASP.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

2018
A Neural Network for Decision Making in Real-Time Heuristic Search.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

A Suboptimality Bound for 2<sup>k</sup> Grid Path Planning.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Anytime Focal Search with Applications.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Multi-Agent Pathfinding with Real-Time Heuristic Search.
Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, 2018

2017
Fast and Almost Optimal Any-Angle Pathfinding Using the 2<sup>k</sup> Neighborhoods.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Improving MPGAA* for Extended Visibility Ranges.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Grid Pathfinding on the 2<i>k</i> Neighborhoods.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs.
J. Artif. Intell. Res., 2016

2015
Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps.
IEEE Trans. Comput. Intell. AI Games, 2015

Incorporating weights into real-time heuristic search.
Artif. Intell., 2015

Reusing cost-minimal paths for goal-directed navigation in partially known terrains.
Auton. Agents Multi Agent Syst., 2015

Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Reconnection with the Ideal Tree: A New Approach to Real-Time Search.
J. Artif. Intell. Res., 2014

Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Time-Bounded Best-First Search.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Weighted real-time heuristic search.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Moving Target Search with Compressed Path Databases.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Avoiding and Escaping Depressions in Real-Time Heuristic Search.
J. Artif. Intell. Res., 2012

Subgoal Graphs for Eight-Neighbor Gridworlds.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Paper Summary: Time-Bounded Adaptive A.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Position Paper: Incremental Search Algorithms Considered Poorly Understood.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Time-bounded adaptive A.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Real-Time Adaptive A* with Depression Avoidance.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Real-Time Heuristic Search with Depression Avoidance.
Proceedings of the IJCAI 2011, 2011

Tree Adaptive A.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Escaping heuristic depressions in real-time heuristic search.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Fast Subgoaling for Pathfinding via Real-Time Search.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010
Escaping Heuristic Hollows in Real-Time Search without Learning.
Proceedings of the SCCC 2010, 2010

2009
Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2007
Improving LRTA*(k).
Proceedings of the IJCAI 2007, 2007

Improving HLRTA*( <i>k</i> ).
Proceedings of the Current Topics in Artificial Intelligence, 2007

2005
Propagating updates in real-time search: FALCONS(k).
Proceedings of the XXV International Conference of the Chilean Computer Science Society, 2005

LRTA*(k).
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Propagating Updates in Real-Time Search: HLRTA*(<i>k</i>).
Proceedings of the Current Topics in Artificial Intelligence, 2005


  Loading...