Jorge A. Baier

J. Artif. Intell. Res., 2022

Scaling up ML-based Black-box Planning with Partial STRIPS Models.

[BibT_eX]

[DOI]

CoRR, 2022

Knowledge-based programs as building blocks for planning.

[BibT_eX]

[DOI]

Artif. Intell., 2022

K-Focal Search for Slow Learned Heuristics (Extended Abstract).

[BibT_eX]

[DOI]

Jorge Toro

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Focal Discrepancy Search for Learned Heuristics (Extended Abstract).

[BibT_eX]

[DOI]

Pablo Araneda

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract).

[BibT_eX]

[DOI]

Nicolás Rivera

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Real-Time Heuristic Search with LTLf Goals.

[BibT_eX]

[DOI]

Jaime Middleton

Rodrigo Toro Icarte

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Towards Effective Blended Learning Through the Eyes of Students: A Survey Study in Transition into Face-to-Face Education.

[BibT_eX]

[DOI]

Proceedings of the Educating for a New Future: Making Sense of Technology-Enhanced Learning Adoption, 2022

Subset Approximation of Pareto Regions with Bi-objective A.

[BibT_eX]

[DOI]

Nicolás Rivera

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A MOOC-based flipped experience: Scaffolding SRL strategies improves learners' time management and engagement.

[BibT_eX]

[DOI]

Jorge Maldonado-Mahauad

Comput. Appl. Eng. Educ., 2021

A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Rodrigo N. Gómez

IEEE Access, 2021

Exploiting Learned Policies in Focal Search.

[BibT_eX]

[DOI]

Pablo Araneda

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers.

[BibT_eX]

[DOI]

Roberto Javier Asín Achá

Rodrigo López

Sebastián Hagedorn

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

2020

The 2^k Neighborhoods for Grid Path Planning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

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

[BibT_eX]

[DOI]

Roberto Javier Asín Achá

IEEE Access, 2020

A Simple and Fast Bi-Objective Search Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

FAIS: A System for Effectively Learning Students Names and Faces in Massive Courses.

[BibT_eX]

[DOI]

Jorge Munoz-Gama

Raul Alvarez-Esteban

José Montalva-Carmona

Miguel Ángel Zúñiga Prieto

Proceedings of the 39th International Conference of the Chilean Computer Science Society, 2020

Offering an Entrepreneurship Course to All Engineering Students: Self-efficacy Gains and Learning Benefits.

[BibT_eX]

[DOI]

Proceedings of the IEEE Frontiers in Education Conference, 2020

For Learners, with Learners: Identifying Indicators for an Academic Advising Dashboard for Students.

[BibT_eX]

[DOI]

Margarita Ortiz-Rojas

Mar Pérez-Sanagustín

Proceedings of the Addressing Global Challenges and Quality Education, 2020

Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming.

[BibT_eX]

[DOI]

Rodrigo N. Gómez

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Compiling Cost-Optimal Multi-Agent Pathfinding to ASP.

[BibT_eX]

[DOI]

Rodrigo N. Gómez

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

2018

A Neural Network for Decision Making in Real-Time Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

A Suboptimality Bound for 2k Grid Path Planning.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

On the Progression of Situation Calculus Universal Theories with Constants.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

SynKit: LTL Synthesis as a Service.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

LTL Realizability via Safety and Reachability Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Finite LTL Synthesis as Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Synthesizing Controllers: On the Correspondence Between LTL Synthesis and Non-deterministic Planning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2018

2017

Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

How a General-Purpose Commonsense Ontology can Improve Performance of Learning-Based Image Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Evaluating Navigational RDF Queries over the Web.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Conference on Hypertext and Social Media, 2017

Improving MPGAA* for Extended Visibility Ranges.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Grid Pathfinding on the 2k Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Property Paths over Linked Data: Can It Be Done and How To Start?

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Consuming Linked Data co-located with 15th International Semantic Web Conference, 2016

Non-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version).

[BibT_eX]

[DOI]

Proceedings of the Workshop on Knowledge-based Techniques for Problem Solving and Reasoning co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016

Assumption-Based Planning with Sensing via Contingent Planning.

[BibT_eX]

[DOI]

Pamela Calvo

Proceedings of the Workshop on Knowledge-based Techniques for Problem Solving and Reasoning co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016

Incomplete Causal Laws in the Situation Calculus Using Free Fluents.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Intell. AI Games, 2015

Incorporating weights into real-time heuristic search.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Reusing cost-minimal paths for goal-directed navigation in partially known terrains.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2015

Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals.

[BibT_eX]

[DOI]

Jorge Torres

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Reconnection with the Ideal Tree: A New Approach to Real-Time Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Time-Bounded Best-First Search.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals.

[BibT_eX]

[DOI]

Brent Mombourquette

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Real-Time Pathfinding in Unknown Terrain via Reconnection with an Ideal Tree.

[BibT_eX]

[DOI]

Leon Illanes

Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2014, 2014

Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Weighted real-time heuristic search.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Moving Target Search with Compressed Path Databases.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge.

[BibT_eX]

[DOI]

Sammy Davis-Mendelow

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Avoiding and Escaping Depressions in Real-Time Heuristic Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2012

Reports of the AAAI 2012 Conference Workshops.

[BibT_eX]

[DOI]

Artur S. d'Avila Garcez

AI Mag., 2012

Paper Summary: Time-Bounded Adaptive A.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Position Paper: Incremental Search Algorithms Considered Poorly Understood.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Time-bounded adaptive A.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Planning with rich goals, preferences and procedural operators via reformulation.

[BibT_eX]

[DOI]

AI Commun., 2011

Real-Time Adaptive A* with Depression Avoidance.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Real-Time Heuristic Search with Depression Avoidance.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Escaping heuristic depressions in real-time heuristic search.

[BibT_eX]

[DOI]

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

Fast Subgoaling for Pathfinding via Real-Time Search.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Preferred Explanations: Theory and Generation via Planning.

[BibT_eX]

[DOI]

Shirin Sohrabi

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Effective Search Techniques for Non-classical Planning via Reformulation.

[BibT_eX]

[DOI]

PhD thesis, 2010

Escaping Heuristic Hollows in Real-Time Search without Learning.

[BibT_eX]

[DOI]

Proceedings of the SCCC 2010, 2010

Diagnosis as Planning Revisited.

[BibT_eX]

[DOI]

Shirin Sohrabi

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

2009

A heuristic search approach to planning with temporally extended preferences.

[BibT_eX]

[DOI]

Fahiem Bacchus

Artif. Intell., 2009

HTN Planning with Preferences.

[BibT_eX]

[DOI]

Shirin Sohrabi

Proceedings of the IJCAI 2009, 2009

Exploiting N-Gram Analysis to Predict Operator Sequences.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

Improving Planning Performance Using Low-Conflict Relaxed Plans.

[BibT_eX]

[DOI]

Adi Botea

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

Planning with Preferences.

[BibT_eX]

[DOI]

AI Mag., 2008

ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond.

[BibT_eX]

[DOI]

Christian Fritz

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners.

[BibT_eX]

[DOI]

Christian Fritz

Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

On Domain-Independent Heuristics for Planning with Qualitative Preferences.

[BibT_eX]

[DOI]

Proceedings of the Logical Formalizations of Commonsense Reasoning, 2007

2006

On Planning with Programs that Sense.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

Planning with Temporally Extended Goals Using Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Planning with First-Order Temporally Extended Goals using Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2004

Semantic Search in the WWW Supported by a Cognitive Model.

[BibT_eX]

[DOI]

Katia Wechsler

Miguel Nussbaum

Ricardo A. Baeza-Yates

Proceedings of the Advances in Web-Age Information Management: 5th International Conference, 2004

2003

Planning under uncertainty as Golog programs.

[BibT_eX]

[DOI]

Javier Pinto

J. Exp. Theor. Artif. Intell., 2003

2002

On Procedure Recognition in the Situation Calculus.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference of the Chilean Computer Science Society (SCCC 2002), 2002

1999

Integrating True Concurrency into the Robot Programming Language.

[BibT_eX]

[DOI]