| Simple and efficient bi-objective search algorithms via fast dominance checks | 0 | 0.34 | 2023 |
| Real-Time Heuristic Search with LTLf Goals | 0 | 0.34 | 2022 |
| Real-Time Heuristic Search with LTLf Goals. | 0 | 0.34 | 2022 |
| Knowledge-based programs as building blocks for planning | 0 | 0.34 | 2022 |
| Subset Approximation of Pareto Regions with Bi-objective A. | 0 | 0.34 | 2022 |
| A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. | 0 | 0.34 | 2021 |
| The 2^k Neighborhoods for Grid Path Planning | 0 | 0.34 | 2020 |
| A Simple and Fast Bi-Objective Search Algorithm. | 0 | 0.34 | 2020 |
| A Simple and Fast Bi-Objective Search Algorithm. | 0 | 0.34 | 2020 |
| FAIS: A System for Effectively Learning Students Names and Faces in Massive Courses | 0 | 0.34 | 2020 |
| Compiling Cost-Optimal Multi-Agent Pathfinding to ASP. | 0 | 0.34 | 2019 |
| A Learning-Based Framework for Memory-Bounded Heuristic Search - First Results. | 0 | 0.34 | 2019 |
| A Suboptimality Bound for 2k Grid Path Planning. | 0 | 0.34 | 2018 |
| Synthesizing Controllers: On the Correspondence Between LTL Synthesis and Non-deterministic Planning. | 0 | 0.34 | 2018 |
| A Neural Network for Decision Making in Real-Time Heuristic Search. | 0 | 0.34 | 2018 |
| LTL Realizability via Safety and Reachability Games. | 0 | 0.34 | 2018 |
| On the Progression of Situation Calculus Universal Theories with Constants. | 0 | 0.34 | 2018 |
| Finite LTL Synthesis as Planning. | 2 | 0.37 | 2018 |
| SynKit: LTL Synthesis as a Service. | 0 | 0.34 | 2018 |
| SynKit: LTL Synthesis as a Service. | 0 | 0.34 | 2018 |
| LTL Realizability via Safety and Reachability Games. | 0 | 0.34 | 2018 |
| Grid Pathfinding on the 2k Neighborhoods. | 0 | 0.34 | 2017 |
| Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads. | 2 | 0.41 | 2017 |
| Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods. | 0 | 0.34 | 2017 |
| How a General-Purpose Commonsense Ontology can Improve Performance of Learning-Based Image Retrieval. | 0 | 0.34 | 2017 |
| Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces. | 2 | 0.36 | 2017 |
| Evaluating navigational RDF queries over the Web. | 1 | 0.34 | 2017 |
| Improving MPGAA* for Extended Visibility Ranges. | 0 | 0.34 | 2017 |
| Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs. | 0 | 0.34 | 2016 |
| Incomplete Causal Laws in the Situation Calculus Using Free Fluents. | 0 | 0.34 | 2016 |
| Assumption-Based Planning with Sensing via Contingent Planning. | 0 | 0.34 | 2016 |
| Non-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version). | 0 | 0.34 | 2016 |
| Reusing Previously Found A* Paths For Fast Goal-Directed Navigation In Dynamic Terrain | 1 | 0.35 | 2015 |
| Incorporating weights into real-time heuristic search | 4 | 0.44 | 2015 |
| Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps | 3 | 0.41 | 2015 |
| Reusing cost-minimal paths for goal-directed navigation in partially known terrains | 1 | 0.38 | 2015 |
| Time-Bounded Best-First Search. | 1 | 0.35 | 2014 |
| Learning and reasoning with action-related places for robust mobile manipulation | 7 | 0.53 | 2014 |
| Reconnection with the ideal tree: a new approach to real-time search | 2 | 0.40 | 2014 |
| Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound. | 0 | 0.34 | 2014 |
| Avoiding and escaping depressions in real-time heuristic search | 19 | 0.83 | 2014 |
| Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals. | 3 | 0.39 | 2014 |
| Real-Time Pathfinding in Unknown Terrain via Reconnection with an Ideal Tree. | 0 | 0.34 | 2014 |
| Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain. | 3 | 0.44 | 2014 |
| Topic-based dissimilarity and sensitivity models for translation rule selection | 6 | 0.41 | 2014 |
| Topic-based dissimilarity and sensitivity models for translation rule selection | 6 | 0.41 | 2014 |
| Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge. | 5 | 0.45 | 2013 |
| Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search. | 5 | 0.44 | 2013 |
| Weighted real-time heuristic search | 4 | 0.41 | 2013 |
| Moving Target Search with Compressed Path Databases. | 7 | 0.52 | 2013 |
