Jorge A. Baier

Orcid: 0000-0002-6280-5619

Affiliations:
  • Pontificia Universidad Católica de Chile, Santiago, Chile
  • University of Toronto, ON, Canada (PhD 2009)


According to our database1, Jorge A. Baier authored at least 93 papers between 1999 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

A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract).
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

How Could Be Used Student Comments for Delivering Feedback to Instructors in Higher Education?
Proceedings of the Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners, Doctoral Consortium and Blue Sky, 2024

2023
Using Automated Planning to Provide Feedback during Collaborative Problem-Solving.
Int. J. Artif. Intell. Educ., December, 2023

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

2022
Multi-Agent Path Finding: A New Boolean Encoding.
J. Artif. Intell. Res., 2022

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

Knowledge-based programs as building blocks for planning.
Artif. Intell., 2022

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

Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Focal Discrepancy Search for 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

Real-Time Heuristic Search with LTLf Goals.
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.
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.
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.
Comput. Appl. Eng. Educ., 2021

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

Exploiting Learned Policies in Focal Search.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 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

FAIS: A System for Effectively Learning Students Names and Faces in Massive Courses.
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.
Proceedings of the IEEE Frontiers in Education Conference, 2020

For Learners, with Learners: Identifying Indicators for an Academic Advising Dashboard for Students.
Proceedings of the Addressing Global Challenges and Quality Education, 2020

A Simple and Fast Bi-Objective Search Algorithm.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

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

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

On the Progression of Situation Calculus Universal Theories with Constants.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

SynKit: LTL Synthesis as a Service.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

LTL Realizability via Safety and Reachability Games.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Finite LTL Synthesis as Planning.
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.
Proceedings of the Advances in Artificial Intelligence, 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

How a General-Purpose Commonsense Ontology can Improve Performance of Learning-Based Image Retrieval.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

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

Evaluating Navigational RDF Queries over the Web.
Proceedings of the 28th ACM Conference on Hypertext and Social Media, 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

Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces.
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

Property Paths over Linked Data: Can It Be Done and How To Start?
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).
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.
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.
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.
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

Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals.
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.
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

Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals.
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.
Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2014, 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

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

Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

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

Reports of the AAAI 2012 Conference Workshops.
AI Mag., 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
Planning with rich goals, preferences and procedural operators via reformulation.
AI Commun., 2011

Real-Time Heuristic Search with Depression Avoidance.
Proceedings of the IJCAI 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

Real-Time Adaptive A* with Depression Avoidance.
Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2011

Preferred Explanations: Theory and Generation via Planning.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Effective Search Techniques for Non-classical Planning via Reformulation.
PhD thesis, 2010

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

Diagnosis as Planning Revisited.
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.
Artif. Intell., 2009

HTN Planning with Preferences.
Proceedings of the IJCAI 2009, 2009

Exploiting N-Gram Analysis to Predict Operator Sequences.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

Improving Planning Performance Using Low-Conflict Relaxed Plans.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
Planning with Preferences.
AI Mag., 2008

ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond.
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.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

On Domain-Independent Heuristics for Planning with Qualitative Preferences.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2007

2006
On Planning with Programs that Sense.
Proceedings of the Proceedings, 2006

Planning with Temporally Extended Goals Using Heuristic Search.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Planning with First-Order Temporally Extended Goals using Heuristic Search.
Proceedings of the Proceedings, 2006

2004
Semantic Search in the WWW Supported by a Cognitive Model.
Proceedings of the Advances in Web-Age Information Management: 5th International Conference, 2004

2003
Planning under uncertainty as Golog programs.
J. Exp. Theor. Artif. Intell., 2003

2002
On Procedure Recognition in the Situation Calculus.
Proceedings of the 22nd International Conference of the Chilean Computer Science Society (SCCC 2002), 2002

1999
Integrating True Concurrency into the Robot Programming Language.
Proceedings of the 19th International Conference of the Chilean Computer Science Society (SCCC '99), 1999


  Loading...