Abstract is missing.
- Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path FindingLiron Cohen, Tansel Uras, Sven Koenig. 2-8 [doi]
- Monte-Carlo Tree Search for the Multiple Sequence Alignment ProblemStefan Edelkamp, Zhihao Tang. 9-17 [doi]
- The Spurious Path Problem in AbstractionGaojian Fan, Robert C. Holte. 18-27 [doi]
- Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFSAriel Felner. 28-34 [doi]
- Exploring the Synergy between Two Modular Learning Techniques for Automated PlanningRaquel Fuentetaja, Lukás Chrpa, Thomas Leo McCluskey, Mauro Vallati. 35-43 [doi]
- Red-Black Planning: A New Tractability Analysis and Heuristic FunctionDaniel Gnad, Jörg Hoffmann 0001. 44-52 [doi]
- From Fork Decoupling to Star-Topology DecouplingDaniel Gnad, Jörg Hoffmann 0001, Carmel Domshlak. 53-61 [doi]
- Computing Plans with Control Flow and Procedures Using a Classical PlannerSergio Jiménez Celorrio, Anders Jonsson. 62-69 [doi]
- Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov ChainsYisroel Mirsky, Aviad Cohen, Roni Stern, Ariel Felner, Lior Rokach, Yuval Elovici, Bracha Shapira. 70-77 [doi]
- Improved Multi-Heuristic A* for Searching with Uncalibrated HeuristicsVenkatraman Narayanan, Sandip Aine, Maxim Likhachev. 78-86 [doi]
- Metareasoning in Real-Time Heuristic SearchDylan O'Ceallaigh, Wheeler Ruml. 87-95 [doi]
- Solving the Snake in the Box Problem with Heuristic Search: First ResultsAlon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml. 96-104 [doi]
- Sibling Conspiracy Number SearchJakub Pawlewicz, Ryan B. Hayward. 105-112 [doi]
- Finding and Exploiting LTL Trajectory Constraints in Heuristic SearchSalomé Simon, Gabriele Röger. 113-121 [doi]
- Focusing on What Really Matters: Irrelevance Pruning in Merge-and-ShrinkÁlvaro Torralba, Peter Kissmann. 122-130 [doi]
- Building a Heuristic for Greedy SearchChristopher Makoto Wilt, Wheeler Ruml. 131-140 [doi]
- Learning to Search More Efficiently from Experience: A Multi-Heuristic ApproachSandip Aine, Charupriya Sharma, Maxim Likhachev. 141-145 [doi]
- No One SATPlan Encoding To Rule Them AllTomas Balyo, Roman Barták. 146-150 [doi]
- Type System Based Rational Lazy IDAOded Betzalel, Ariel Felner, Solomon Eyal Shimony. 151-155 [doi]
- Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree SearchZahy Bnaya, Alon Palombo, Rami Puzis, Ariel Felner. 156-160 [doi]
- Planning with Always Preferences by Compilation into STRIPS with Action CostsLuca Ceriani, Alfonso Emilio Gerevini. 161-165 [doi]
- Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer EntanglementsLukás Chrpa, Enrico Scala, Mauro Vallati. 166-170 [doi]
- Caching in Context-Minimal OR SpacesRina Dechter, Levi H. S. Lelis, Lars Otten. 171-175 [doi]
- Expected Path Degradation when Searching over a Sparse Grid HierarchyRobert Kolchmeyer, Andrew Joseph Dobson, Kostas E. Bekris. 176-180 [doi]
- Computational Tradeoffs of Search Methods for Minimum Constraint Removal PathsAthanasios Krontiris, Kostas E. Bekris. 181-185 [doi]
- A Preliminary Selection of Problems in Heuristic SearchCarlos Linares López, Abdallah Saffidine. 186-190 [doi]
- Feature Selection as State-Space Search: An Empirical Study in Clustering ProblemsJulian R. H. Mariño, Levi H. S. Lelis. 191-195 [doi]
- Partial Domain Search Tree for Constraint-Satisfaction ProblemsGuni Sharon. 196-200 [doi]
- Maximum a Posteriori Estimation by Search in Probabilistic ProgramsDavid Tolpin, Frank Wood. 201-205 [doi]
- An Empirical Comparison of Any-Angle Path-Planning AlgorithmsTansel Uras, Sven Koenig. 206-211 [doi]
- Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary EvaluationWilliam Lam, Kalev Kask, Rina Dechter. 212-213 [doi]
- Automated Transformation of PDDL RepresentationsPatricia J. Riddle, Michael W. Barley, Santiago Franco, Jordan Douglas. 214-215 [doi]
- Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract)Sascha Scherrer, Florian Pommerening, Martin Wehrle. 216-217 [doi]
- To Reopen or Not To Reopen in the Context of Weighted A*. Classifications of Different Trends (Extended Abstract)Vitali Sepetnitsky, Ariel Felner. 218-220 [doi]
- Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)Ron Alford, Pascal Bercher, David W. Aha. 221-222 [doi]
- ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent PathfindingEli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, Solomon Eyal Shimony. 223-225 [doi]
- Planning Single-Arm Manipulations with N-Arm RobotsBenjamin J. Cohen, Mike Phillips, Maxim Likhachev. 226-227 [doi]
- Delete Relaxations for Planning with State-Dependent Action CostsFlorian Geißer, Thomas Keller 0001, Robert Mattmüller. 228-229 [doi]
- Dynamic Redeployment to Counter Congestion or Starvation in Vehicle Sharing SystemsSupriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet. 230-231 [doi]
- Moving Target Search with Subgoal GraphsDoron Nussbaum, Alper Yörükçü. 232-233 [doi]
- Heuristic Search and Receding-Horizon Planning in Complex Spacecraft Orbit DomainsDavid Allen Surovik, Daniel J. Scheeres. 234-235 [doi]
- UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path FindingPavel Surynek. 236-237 [doi]
- PLEASE: Palm Leaf Search for POMDPs with Large Observation SpacesZongzhang Zhang, David Hsu, Wee Sun Lee, Zhan Wei Lim, Aijun Bai. 238-240 [doi]
- The Grid-Based Path Planning Competition: 2014 Entries and ResultsNathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin. 241 [doi]