Table of Contents

• Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road NetworksTenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt. 2-10 [doi]
• Observation Decoding with Sensor Models: Recognition Tasks via Classical PlanningDiego Aineto, Sergio Jiménez 0003, Eva Onaindia. 11-19 [doi]
• Stochastic Fairness and Language-Theoretic Fairness in Planning in Nondeterministic DomainsBenjamin Aminof, Giuseppe De Giacomo, Sasha Rubin. 20-28 [doi]
• Probabilistic Robust Multi-Agent Path FindingDor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig. 29-37 [doi]
• Through the Lens of Sequence SubmodularitySara Bernardini, Fabio Fagnani, Chiara Piacentini. 38-47 [doi]
• Multiple-Environment Markov Decision Processes: Efficient Analysis and ApplicationsKrishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný 0001, Amélie Royer. 48-56 [doi]
• Adaptive Informative Path Planning with Multimodal SensingShushman Choudhury, Nate Gruver, Mykel J. Kochenderfer. 57-65 [doi]
• Multi-Tier Automated Planning for Adaptive BehaviorDaniel Ciolek, Nicolás D'Ippolito, Alberto Pozanco, Sebastian Sardiña. 66-74 [doi]
• Solving the Longest Simple Path Problem with Heuristic SearchYossi Cohen, Roni Stern, Ariel Felner. 75-79 [doi]
• Lifted Successor Generation Using Query Optimization TechniquesAugusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès. 80-89 [doi]
• Certified Unsolvability for SAT Planning with Property Directed ReachabilitySalomé Eriksson, Malte Helmert. 90-100 [doi]
• EFP 2.0: A Multi-Agent Epistemic Solver with Multiple E-State RepresentationsFrancesco Fabiano, Alessandro Burigana, Agostino Dovier, Enrico Pontelli. 101-109 [doi]
• Solving K-MDPsJonathan Ferrer-Mestres, Thomas G. Dietterich, Olivier Buffet, Iadine Chadès. 110-118 [doi]
• A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First SearchMaximilian Fickert. 119-123 [doi]
• Strengthening Potential Heuristics with Mutexes and DisambiguationsDaniel Fiser, Rostislav Horcík, Antonín Komenda. 124-133 [doi]
• Online Computation of Euclidean Shortest Paths in Two DimensionsRyan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema. 134-142 [doi]
• A Simple and Fast Bi-Objective Search AlgorithmCarlos Hernández Ulloa, William Yeoh 0001, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig. 143-151 [doi]
• Faster Dynamic-Consistency Checking for Conditional Simple Temporal NetworksLuke Hunsberger, Roberto Posenato. 152-160 [doi]
• Algorithm Selection for Optimal Multi-Agent PathfindingOmri Kaduri, Eli Boyarski, Roni Stern. 161-165 [doi]
• Sequencing Operator Counts with State-Space SearchWesley L. Kaizer, André Grahl Pereira, Marcus Ritt. 166-174 [doi]
• Analyzing and Avoiding Pathological Behavior in Parallel Best-First SearchRyo Kuroiwa 0002, Alex Fukunaga. 175-183 [doi]
• New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path FindingEdward Lam, Pierre Le Bodic. 184-192 [doi]
• New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path FindingJiaoyang Li 0001, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma 0001, Sven Koenig. 193-201 [doi]
• Efficient Robot Planning for Achieving Multiple Independent Partially Observable Tasks That Evolve over TimeAnahita Mohseni-Kabir, Manuela Veloso, Maxim Likhachev. 202-211 [doi]
• On the Computational Complexity of Multi-Agent Pathfinding on Directed GraphsBernhard Nebel. 212-216 [doi]
• Convex Hull Monte-Carlo Tree-SearchMichael Painter, Bruno Lacerda, Nick Hawes. 217-225 [doi]
• Search-Guidance Mechanisms for Numeric Planning Through Subgoaling RelaxationEnrico Scala, Alessandro Saetti, Ivan Serina, Alfonso Emilio Gerevini. 226-234 [doi]
• POMDP + Information-Decay: Incorporating Defender's Behaviour in Autonomous Penetration TestingJonathon Schwartz, Hanna Kurniawati, Edwin El Mahassni. 235-243 [doi]
• Incremental Search for Counterexample-Guided Cartesian Abstraction RefinementJendrik Seipp, Samuel von Allmen, Malte Helmert. 244-248 [doi]
• Solving the Watchman Route Problem on a Grid with Heuristic SearchShawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner. 249-257 [doi]
• Privacy Preserving Planning in Stochastic EnvironmentsGuy Shani, Roni Stern, Tommy Hefner. 258-262 [doi]
• When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic SearchDavid Speck, Florian Geißer, Robert Mattmüller. 263-271 [doi]
• Predicting the Effectiveness of Bidirectional Heuristic SearchNathan R. Sturtevant, Shahaf S. Shperberg, Ariel Felner, Jingwei Chen. 281-290 [doi]
• Computing Close to Optimal Weighted Shortest Paths in PracticeNguyet Tran, Michael J. Dinneen, Simone Linz. 291-299 [doi]
• Revisiting Bounded-Suboptimal Safe Interval Path PlanningKonstantin S. Yakovlev, Anton Andreychuk, Roni Stern. 300-304 [doi]
• Contention-Aware Mapping and Scheduling Optimization for NoC-Based MPSoCsRongjie Yan, Yupeng Zhou, Anyu Cai, Changwen Li, Yige Yan, Minghao Yin. 305-313 [doi]
• Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with UncertaintyMatteo Zavatteri, Romeo Rizzi, Tiziano Villa. 314-322 [doi]
• Multi-Agent Path Finding with Mutex PropagationHan Zhang, Jiaoyang Li 0001, Pavel Surynek, Sven Koenig, T. K. Satish Kumar. 323-332 [doi]
• Bounded Suboptimal Path Planning with Compressed Path DatabasesShizhe Zhao, Mattia Chiari, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Peter J. Stuckey. 333-342 [doi]
• New Developments for Robert - Assisting Novice Users Even Better in DIY ProjectsGregor Behnke, Pascal Bercher, Matthias Kraus, Marvin R. G. Schiller, Kristof Mickeleit, Timo Häge, Michael Dorna, Michael Dambier, Dietrich Manstetten, Wolfgang Minker, Birte Glimm, Susanne Biundo. 343-347 [doi]
• Scheduling with Complex Consumptive Resources for a Planetary RoverWayne Chi, Steve A. Chien, Jagriti Agrawal. 348-356 [doi]
• Solving the Test Laboratory Scheduling Problem with Variable Task GroupingPhilipp Danzinger, Tobias Geibinger, Florian Mischek, Nysret Musliu. 357-365 [doi]
• Online Traffic Signal Control through Sample-Based Constrained OptimizationSrishti Dhamija, Alolika Gon, Pradeep Varakantham, William Yeoh 0001. 366-374 [doi]
• Driver Activity Recognition by Means of Temporal HTN PlanningJuan Fernández-Olivares, Raúl Pérez. 375-383 [doi]
• Optimal and Heuristic Approaches for Constrained Flight Planning under Weather UncertaintyFlorian Geißer, Guillaume Povéda, Felipe W. Trevizan, Manon Bondouy, Florent Teichteil-Königsbuch, Sylvie Thiébaux. 384-393 [doi]
• Deep Reinforcement Learning Approach to Solve Dynamic Vehicle Routing Problem with Stochastic CustomersWaldy Joe, Hoong Chuin Lau. 394-402 [doi]
• Exploring Context-Free Languages via Planning: The Case for Automating Machine LearningMichael Katz 0001, Parikshit Ram, Shirin Sohrabi, Octavian Udrea. 403-411 [doi]
• An AI-Based Planning Framework for HAPS in a Time-Varying EnvironmentJane Jean Kiam, Enrico Scala, Miquel Ramírez Javega, Axel Schulte. 412-420 [doi]
• Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break ConstraintsLucas Kletzander, Nysret Musliu. 421-430 [doi]
• A Decentralised Strategy for Heterogeneous AUV Missions via Goal Distribution and Temporal PlanningYaniel Carreno, Èric Pairet, Yvan R. Pétillot, Ronald P. A. Petrick. 431-439 [doi]
• PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive PlanningCaelan Reed Garrett, Tomás Lozano-Pérez, Leslie Pack Kaelbling. 440-448 [doi]
• Generating Explanations for Temporal Logic Planner DecisionsDaniel Kasenberg, Ravenna Thielstrom, Matthias Scheutz. 449-458 [doi]
• Real Time Crowd Navigation from First Principles of Probability TheoryPeter Trautman, Karankumar Patel. 459-468 [doi]
• Refining Process Descriptions from Execution Data in Hybrid Planning Domain ModelsAlan Lindsay, Santiago Franco, Rubiya Reba, Thomas Leo McCluskey. 469-477 [doi]
• Integrating Acting, Planning, and Learning in Hierarchical Operational ModelsSunandita Patra, James Mason, Amit Kumar, Malik Ghallab, Paolo Traverso, Dana S. Nau. 478-487 [doi]
• - D3WA+ - A Case Study of XAIP in a Model Acquisition Task for Dialogue PlanningSarath Sreedharan, Tathagata Chakraborti, Christian Muise, Yasaman Khazaeni, Subbarao Kambhampati. 488-498 [doi]
• We Mind Your Well-Being: Preventing Depression in Uncertain Social Networks by Sequential InterventionsAye Phyu Phyu Aung, Xinrun Wang, Bo An 0001, Xiaoli Li. 499-507 [doi]
• Learning Sequences of Approximations for Hierarchical Motion PlanningMartim Brandão, Ioannis Havoutis. 508-516 [doi]
• Imitation Learning over Heterogeneous Agents with Restraining BoltsGiuseppe De Giacomo, Marco Favorito, Luca Iocchi, Fabio Patrizi. 517-521 [doi]
• Learning Neural Search Policies for Classical PlanningPawel Gomoluch, Dalal Alrajeh, Alessandra Russo, Antonio Bucchiarone. 522-530 [doi]
• Learning Model Parameters for Decentralized Schedule-Driven Traffic ControlHsu-Chieh Hu, Stephen F. Smith. 531-539 [doi]
• Symbolic Plans as High-Level Instructions for Reinforcement LearningLeón Illanes, Xi Yan, Rodrigo Toro Icarte, Sheila A. McIlraith. 540-550 [doi]
• Reinforcement Learning for Zone Based Multiagent Pathfinding under UncertaintyJiajing Ling, Tarun Gupta 0002, Akshat Kumar. 551-559 [doi]
• Utilising Uncertainty for Efficient Learning of Likely-Admissible HeuristicsOfir Marom, Benjamin Rosman. 560-568 [doi]
• Generating and Exploiting Cost Predictions in Heuristic State-Space PlanningFrancesco Percassi, Alfonso Emilio Gerevini, Enrico Scala, Ivan Serina, Mauro Vallati. 569-573 [doi]
• Learning Domain-Independent Planning Heuristics with Hypergraph NetworksWilliam Shen, Felipe W. Trevizan, Sylvie Thiébaux. 574-584 [doi]
• Guidelines for Action Space Definition in Reinforcement Learning-Based Traffic Signal Control SystemsMaxime Treca, Julian Garbiso, Dominique Barth. 585-589 [doi]
• Joint Inference of Reward Machines and Policies for Reinforcement LearningZhe Xu 0005, Ivan Gavran, Yousef Ahmad, Rupak Majumdar, Daniel Neider, Ufuk Topcu, Bo Wu 0005. 590-598 [doi]