• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the International Symposium on Combinatorial Search /

Vol. 6 No. 1 (2015): Eighth Annual Symposium on Combinatorial Search

Full Papers

  • The Spurious Path Problem in Abstraction

    Gaojian Fan,Robert Holte

    18-27

    PDF
  • Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS

    Ariel Felner

    28-34

    PDF
  • Exploring the Synergy between Two Modular Learning Techniques for Automated Planning

    Raquel Fuentetaja,Lukáŝ Chrpa,Thomas McCluskey,Mauro Vallati

    35-43

    PDF
  • Red-Black Planning: A New Tractability Analysis and Heuristic Function

    Daniel Gnad,Joerg Hoffmann

    44-52

    PDF
  • From Fork Decoupling to Star-Topology Decoupling

    Daniel Gnad,Joerg Hoffmann,Carmel Domshlak

    53-61

    PDF
  • Computing Plans with Control Flow and Procedures Using a Classical Planner

    Sergio Jimenez Celorrio,Anders Jonsson

    62-69

    PDF
  • Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov Chains

    Yisroel Mirsky,Aviad Cohen,Roni Stern,Ariel Felner,Lior Rokack,Yuval Elovici,Bracha Shapira

    70-77

    PDF
  • Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics

    Venkatraman Narayanan,Sandip Aine,Maxim Likhachev

    78-86

    PDF
  • Metareasoning in Real-Time Heuristic Search

    Dylan O'Ceallaigh,Wheeler Ruml

    87-95

    PDF
  • Solving the Snake in the Box Problem with Heuristic Search: First Results

    Alon Palombo,Roni Stern,Rami Puzis,Ariel Felner,Scott Kiesel,Wheeler Ruml

    96-104

    PDF
  • Sibling Conspiracy Number Search

    Jakub Pawlewicz,Ryan Hayward

    105-112

    PDF
  • Finding and Exploiting LTL Trajectory Constraints in Heuristic Search

    Salomé Simon,Gabriele Röger

    113-121

    PDF
  • Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink

    Álvaro Torralba,Peter Kissmann

    122-130

    PDF
  • Building a Heuristic for Greedy Search

    Christopher Wilt,Wheeler Ruml

    131-140

    PDF
  • Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding

    Liron Cohen,Tansel Uras,Sven Koenig

    44965

    PDF
  • Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem

    Stefan Edelkamp,Zhihao Tang

    45186

    PDF

Short Papers

  • Caching in Context-Minimal OR Spaces

    Rina Dechter,Levi Lelis,Lars Otten

    171-175

    PDF
  • Expected Path Degradation when Searching over a Sparse Grid Hierarchy

    Robert Kolchmeyer,Andrew Dobson,Kostas Bekris

    176-180

    PDF
  • Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths

    Athanasios Krontiris,Kostas Bekris

    181-185

    PDF
  • A Preliminary Selection of Problems in Heuristic Search

    Carlos Linares López,Abdallah Saffidine

    186-190

    PDF
  • Feature Selection as State-Space Search: An Empirical Study in Clustering Problems

    Julian Mariño,Levi Lelis

    191-195

    PDF
  • Partial Domain Search Tree for Constraint-Satisfaction Problems

    Guni Sharon

    196-200

    PDF
  • Maximum a Posteriori Estimation by Search in Probabilistic Programs

    David Tolpin,Frank Wood

    201-205

    PDF
  • An Empirical Comparison of Any-Angle Path-Planning Algorithms

    Tansel Uras,Sven Koenig

    206-210

    PDF
  • Learning to Search More Efficiently from Experience: A Multi-heuristic Approach

    Sandip Aine,Charupriya Sharma,Maxim Likhachev

    141-145

    PDF
  • No One SATPlan Encoding To Rule Them All

    Tomáš Balyo,Roman Barták

    146-150

    PDF
  • Type System Based Rational Lazy IDA*

    Oded Betzalel,Ariel Felner,Solomon Shimony

    151-155

    PDF
  • Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree Search

    Zahy Bnaya,Alon Palombo,Rami Puzis,Ariel Felner

    156-160

    PDF
  • Planning with Always Preferences by Compilation into STRIPS with Action Costs

    Luca Ceriani,Alfonso Gerevini

    161-165

    PDF
  • Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements

    Lukáš Chrpa,Enrico Scala,Mauro Vallati

    166-170

    PDF

Original Research Abstracts

  • Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation

    William Lam,Kalev Kask,Rina Dechter

    212-213

    PDF
  • Automated Transformation of PDDL Representations

    Patricia Riddle,Michael Barley,Santiago Franco,Jordan Douglas

    214-215

    PDF
  • Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract)

    Sascha Scherrer,Florian Pommerening,Martin Wehrle

    216-217

    PDF
  • To Reopen or Not To Reopen in the Context of Weighted A*. Classifications of Different Trends (Extended Abstract)

    Vitali Sepetnitsky,Ariel Felner

    218-219

    PDF

Abstracts

  • PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces

    Zongzhang Zhang,David Hsu,Wee Sun Lee,Zhan Wei Lim,Aijun Bai

    238-239

    PDF
  • Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)

    Ron Alford,Pascal Bercher,David Aha

    221-222

    PDF
  • ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

    Eli Boyarski,Ariel Felner,Roni Stern,Guni Sharon,Oded Betzalel,David Tolpin,Eyal Shimony

    223-225

    PDF
  • Planning Single-Arm Manipulations with N-Arm Robots

    Benjamin Cohen,Mike Phillips,Maxim Likhachev

    226-227

    PDF
  • Delete Relaxations for Planning with State-Dependent Action Costs

    Florian Geißer,Thomas Keller,Robert Mattmüller

    228-229

    PDF
  • Dynamic Redeployment to Counter Congestion or Starvation in Vehicle Sharing Systems

    Supriyo Ghosh,Pradeep Varakantham,Yossiri Adulyasak,Patrick Jaillet

    230-231

    PDF
  • Moving Target Search with Subgoal Graphs

    Doron Nussbaum,Alper Yörükçü

    232-233

    PDF
  • Heuristic Search and Receding-Horizon Planning in Complex Spacecraft Orbit Domains

    David Surovik,Daniel Scheeres

    234-235

    PDF
  • UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding

    Pavel Surynek

    236-237

    PDF

Invited Talks

  • The Grid-Based Path Planning Competition: 2014 Entries and Results

    Nathan Sturtevant,Jason Traish,James Tulip,Tansel Uras,Sven Koenig,Ben Strasser,Adi Botea,Daniel Harabor,Steve Rabin

    241-250

    PDF

Primary Sidebar