Carlos Hernández

Computer Science · Physical Sciences

14h-index700citations89works2.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Robotic Path Planning Algorithms(45), AI-based Problem Solving and Planning(30), Constraint Satisfaction and Optimization(20), Artificial Intelligence in Games(12), Data Management and Algorithms(7)

Publications84 total

Benchmarking MOEAs for solving continuous multi-objective RL problems
arXiv (Cornell University)·2025Open Access
EMOA*: A framework for search-based multi-objective path planning
Artificial Intelligence·2024· 6 cited
A Preliminary Study of Self-Regulation Strategies in Chilean Engineering Students
2024
K-Focal Search for Slow Learned Heuristics
IEEE Access·2023· 1 citedOpen Access
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities
2023· 14 citedOpen Access
Predicting the Number of Emergency Department Patients with Forecasting Models Based on Machine Learning
2023
Applying Prediction Models Based on Ensemble Machine Learning Algorithms to Estimate Resource Requirements at Healthcare Centers
2023
Simple and efficient bi-objective search algorithms via fast dominance checks
Artificial Intelligence·2022· 26 cited
The use of audiovisual resources and structured teaching materials in the teaching of mathematics
1er Congreso Universal de las Ciencias y la Investigación·2022
The taptana as didactic material in the learning of the four basic operations
1er Congreso Universal de las Ciencias y la Investigación·2022
The taptana as a didactic material for teaching addition and subtraction in students
1er Congreso Universal de las Ciencias y la Investigación·2022
Analysis and Computation of Multidimensional Linear Complexity of Periodic Arrays
arXiv (Cornell University)·2022Open Access
Subset Approximation of Pareto Regions with Bi-objective A*
Proceedings of the AAAI Conference on Artificial Intelligence·2022· 6 citedOpen Access
Compiling Cost-Optimal Multi-Agent Pathfinding to ASP
Proceedings of the International Symposium on Combinatorial Search·2021Open Access
Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound
Proceedings of the International Symposium on Combinatorial Search·2021· 1 citedOpen Access
Time-Bounded Best-First Search
Proceedings of the International Symposium on Combinatorial Search·2021· 3 citedOpen Access
A Neural Network for Decision Making in Real-Time Heuristic Search
Proceedings of the International Symposium on Combinatorial Search·2021· 5 citedOpen Access
A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results
Proceedings of the International Symposium on Combinatorial Search·2021· 1 citedOpen Access
A Suboptimality Bound for 2k Grid Path Planning
Proceedings of the International Symposium on Combinatorial Search·2021· 4 citedOpen Access
Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods
Proceedings of the International Symposium on Combinatorial Search·2021· 8 citedOpen Access
page 1 of 5Next →

Frequent Co-authors

Jorge A. Baier(32), Sven Koenig(12), Nicolás Rivera(7), Tansel Uras(5), Pedro Meseguer(5), Roberto Asín‐Achá(5), Ariel Felner(3), Vadim Bulitko(3), William Yeoh(3), Oren Salzman(3), Adi Botea(3), Matias Greco(2), Devon Sigurdson(2), Daniel Harabor(2), Rodrigo Gómez(2), Nicolás Hormazábal(2), Xiaoxun Sun(2), León Illanes(2), Yudith Contreras(2), Miguel Vera(2)