default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th ICAPS 2020: Nancy, France
- J. Christopher Beck, Olivier Buffet, Jörg Hoffmann, Erez Karpas, Shirin Sohrabi:
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, Nancy, France, October 26-30, 2020. AAAI Press 2020, ISBN 978-1-57735-824-4
Main Track
- Tenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt:
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks. 2-10 - Diego Aineto, Sergio Jiménez, Eva Onaindia:
Observation Decoding with Sensor Models: Recognition Tasks via Classical Planning. 11-19 - Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Stochastic Fairness and Language-Theoretic Fairness in Planning in Nondeterministic Domains. 20-28 - Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. 29-37 - Sara Bernardini, Fabio Fagnani, Chiara Piacentini:
Through the Lens of Sequence Submodularity. 38-47 - Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer:
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. 48-56 - Shushman Choudhury, Nate Gruver, Mykel J. Kochenderfer:
Adaptive Informative Path Planning with Multimodal Sensing. 57-65 - Daniel Alfredo Ciolek, Nicolás D'Ippolito, Alberto Pozanco, Sebastian Sardiña
:
Multi-Tier Automated Planning for Adaptive Behavior. 66-74 - Yossi Cohen, Roni Stern, Ariel Felner:
Solving the Longest Simple Path Problem with Heuristic Search. 75-79 - Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès:
Lifted Successor Generation Using Query Optimization Techniques. 80-89 - Salomé Eriksson, Malte Helmert:
Certified Unsolvability for SAT Planning with Property Directed Reachability. 90-100 - Francesco Fabiano, Alessandro Burigana, Agostino Dovier, Enrico Pontelli:
EFP 2.0: A Multi-Agent Epistemic Solver with Multiple E-State Representations. 101-109 - Jonathan Ferrer-Mestres, Thomas G. Dietterich, Olivier Buffet, Iadine Chadès:
Solving K-MDPs. 110-118 - Maximilian Fickert:
A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search. 119-123 - Daniel Fiser, Rostislav Horcík, Antonín Komenda:
Strengthening Potential Heuristics with Mutexes and Disambiguations. 124-133 - Ryan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema:
Online Computation of Euclidean Shortest Paths in Two Dimensions. 134-142 - Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm. 143-151 - Luke Hunsberger, Roberto Posenato:
Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks. 152-160 - Omri Kaduri, Eli Boyarski, Roni Stern:
Algorithm Selection for Optimal Multi-Agent Pathfinding. 161-165 - Wesley L. Kaizer, André Grahl Pereira, Marcus Ritt:
Sequencing Operator Counts with State-Space Search. 166-174 - Ryo Kuroiwa, Alex Fukunaga:
Analyzing and Avoiding Pathological Behavior in Parallel Best-First Search. 175-183 - Edward Lam, Pierre Le Bodic:
New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. 184-192 - Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. 193-201 - Anahita Mohseni-Kabir, Manuela Veloso, Maxim Likhachev:
Efficient Robot Planning for Achieving Multiple Independent Partially Observable Tasks That Evolve over Time. 202-211 - Bernhard Nebel:
On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs. 212-216 - Michael Painter, Bruno Lacerda, Nick Hawes:
Convex Hull Monte-Carlo Tree-Search. 217-225 - Enrico Scala, Alessandro Saetti, Ivan Serina, Alfonso Emilio Gerevini:
Search-Guidance Mechanisms for Numeric Planning Through Subgoaling Relaxation. 226-234 - Jonathon Schwartz, Hanna Kurniawati, Edwin El-Mahassni:
POMDP + Information-Decay: Incorporating Defender's Behaviour in Autonomous Penetration Testing. 235-243 - Jendrik Seipp, Samuel von Allmen, Malte Helmert:
Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. 244-248 - Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner:
Solving the Watchman Route Problem on a Grid with Heuristic Search. 249-257 - Guy Shani, Roni Stern, Tommy Hefner:
Privacy Preserving Planning in Stochastic Environments. 258-262 - David Speck, Florian Geißer, Robert Mattmüller:
When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search. 263-271 - Sarath Sreedharan, Siddharth Srivastava, Subbarao Kambhampati:
TLdR: Policy Summarization for Factored SSP Problems Using Temporal Abstractions. 272-280 - Nathan R. Sturtevant, Shahaf S. Shperberg, Ariel Felner, Jingwei Chen:
Predicting the Effectiveness of Bidirectional Heuristic Search. 281-290 - Nguyet Tran, Michael J. Dinneen, Simone Linz:
Computing Close to Optimal Weighted Shortest Paths in Practice. 291-299 - Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Revisiting Bounded-Suboptimal Safe Interval Path Planning. 300-304 - Rongjie Yan, Yupeng Zhou, Anyu Cai, Changwen Li, Yige Yan, Minghao Yin:
Contention-Aware Mapping and Scheduling Optimization for NoC-Based MPSoCs. 305-313 - Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty. 314-322 - Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. 323-332 - Shizhe Zhao, Mattia Chiari, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Peter J. Stuckey:
Bounded Suboptimal Path Planning with Compressed Path Databases. 333-342
Novel Applications
- Gregor 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:
New Developments for Robert - Assisting Novice Users Even Better in DIY Projects. 343-347 - Wayne Chi, Steve A. Chien, Jagriti Agrawal:
Scheduling with Complex Consumptive Resources for a Planetary Rover. 348-356 - Philipp Danzinger, Tobias Geibinger, Florian Mischek, Nysret Musliu:
Solving the Test Laboratory Scheduling Problem with Variable Task Grouping. 357-365 - Srishti Dhamija, Alolika Gon, Pradeep Varakantham, William Yeoh:
Online Traffic Signal Control through Sample-Based Constrained Optimization. 366-374 - Juan Fernández-Olivares, Raúl Pérez:
Driver Activity Recognition by Means of Temporal HTN Planning. 375-383 - Florian Geißer, Guillaume Povéda, Felipe W. Trevizan, Manon Bondouy, Florent Teichteil-Königsbuch, Sylvie Thiébaux:
Optimal and Heuristic Approaches for Constrained Flight Planning under Weather Uncertainty. 384-393 - Waldy Joe, Hoong Chuin Lau:
Deep Reinforcement Learning Approach to Solve Dynamic Vehicle Routing Problem with Stochastic Customers. 394-402 - Michael Katz, Parikshit Ram, Shirin Sohrabi, Octavian Udrea:
Exploring Context-Free Languages via Planning: The Case for Automating Machine Learning. 403-411 - Jane Jean Kiam, Enrico Scala, Miquel Ramírez Jávega, Axel Schulte:
An AI-Based Planning Framework for HAPS in a Time-Varying Environment. 412-420 - Lucas Kletzander, Nysret Musliu:
Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints. 421-430
Special Track on Humans and Robotics
- Yaniel Carreno, Èric Pairet, Yvan R. Pétillot, Ronald P. A. Petrick:
A Decentralised Strategy for Heterogeneous AUV Missions via Goal Distribution and Temporal Planning. 431-439 - Caelan Reed Garrett, Tomás Lozano-Pérez, Leslie Pack Kaelbling:
PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning. 440-448 - Daniel Kasenberg, Ravenna Thielstrom, Matthias Scheutz:
Generating Explanations for Temporal Logic Planner Decisions. 449-458 - Peter Trautman, Karankumar Patel:
Real Time Crowd Navigation from First Principles of Probability Theory. 459-468
Special Track on Knowledge Engineering, Integrated Execution, and System Architectures
- Alan Lindsay, Santiago Franco, Rubiya Reba, Thomas Leo McCluskey:
Refining Process Descriptions from Execution Data in Hybrid Planning Domain Models. 469-477 - Sunandita Patra, James Mason, Amit Kumar, Malik Ghallab, Paolo Traverso, Dana S. Nau:
Integrating Acting, Planning, and Learning in Hierarchical Operational Models. 478-487 - Sarath Sreedharan, Tathagata Chakraborti, Christian Muise, Yasaman Khazaeni, Subbarao Kambhampati:
- D3WA+ - A Case Study of XAIP in a Model Acquisition Task for Dialogue Planning. 488-498
Special Track on Planning and Learning
- Aye Phyu Phyu Aung, Xinrun Wang, Bo An, Xiaoli Li:
We Mind Your Well-Being: Preventing Depression in Uncertain Social Networks by Sequential Interventions. 499-507 - Martim Brandão, Ioannis Havoutis:
Learning Sequences of Approximations for Hierarchical Motion Planning. 508-516 - Giuseppe De Giacomo, Marco Favorito, Luca Iocchi, Fabio Patrizi:
Imitation Learning over Heterogeneous Agents with Restraining Bolts. 517-521 - Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo, Antonio Bucchiarone:
Learning Neural Search Policies for Classical Planning. 522-530 - Hsu-Chieh Hu, Stephen F. Smith:
Learning Model Parameters for Decentralized Schedule-Driven Traffic Control. 531-539 - León Illanes, Xi Yan, Rodrigo Toro Icarte, Sheila A. McIlraith:
Symbolic Plans as High-Level Instructions for Reinforcement Learning. 540-550 - Jiajing Ling, Tarun Gupta, Akshat Kumar:
Reinforcement Learning for Zone Based Multiagent Pathfinding under Uncertainty. 551-559 - Ofir Marom, Benjamin Rosman:
Utilising Uncertainty for Efficient Learning of Likely-Admissible Heuristics. 560-568 - Francesco Percassi, Alfonso Emilio Gerevini, Enrico Scala, Ivan Serina, Mauro Vallati:
Generating and Exploiting Cost Predictions in Heuristic State-Space Planning. 569-573 - William Shen, Felipe W. Trevizan, Sylvie Thiébaux:
Learning Domain-Independent Planning Heuristics with Hypergraph Networks. 574-584 - Maxime Tréca, Julian Garbiso, Dominique Barth:
Guidelines for Action Space Definition in Reinforcement Learning-Based Traffic Signal Control Systems. 585-589 - Zhe Xu, Ivan Gavran, Yousef Ahmad, Rupak Majumdar, Daniel Neider, Ufuk Topcu, Bo Wu:
Joint Inference of Reward Machines and Policies for Reinforcement Learning. 590-598
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
