Computing Close to Optimal Weighted Shortest Paths in Practice

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling
1. Verfasser: Tran, Nguyet (VerfasserIn)
Weitere Verfasser: Dinneen, Michael J. (VerfasserIn), Linz, Simone (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2020
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Certified Unsolvability for SAT Planning with Property Directed Reachability 2020 Eriksson, Salomé
EFP 2.0: A Multi-Agent Epistemic Solver with Multiple E-State Representations 2020 Fabiano, Francesco
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding 2020 Li, Jiaoyang
TLdR: Policy Summarization for Factored SSP Problems Using Temporal Abstractions 2020 Sreedharan, Sarath
Deep Reinforcement Learning Approach to Solve Dynamic Vehicle Routing Problem with Stochastic Customers 2020 Joe, Waldy
Integrating Acting, Planning, and Learning in Hierarchical Operational Models 2020 Patra, Sunandita
Learning Neural Search Policies for Classical Planning 2020 Gomoluch, Pawel
Utilising Uncertainty for Efficient Learning of Likely-Admissible Heuristics 2020 Marom, Ofir
Joint Inference of Reward Machines and Policies for Reinforcement Learning 2020 Xu, Zhe
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks 2020 Abeywickrama, Tenindra
Observation Decoding with Sensor Models: Recognition Tasks via Classical Planning 2020 Aineto, Diego
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications 2020 Chatterjee, Krishnendu
Lifted Successor Generation Using Query Optimization Techniques 2020 Corrêa, Augusto B.
Solving K-MDPs 2020 Ferrer-Mestres, Jonathan
Strengthening Potential Heuristics with Mutexes and Disambiguations 2020 Fišer, Daniel
A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search 2020 Fickert, Maximilian
Online Computation of Euclidean Shortest Paths in Two Dimensions 2020 Hechenberger, Ryan
Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks 2020 Hunsberger, Luke
Algorithm Selection for Optimal Multi-Agent Pathfinding 2020 Kaduri, Omri
On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs 2020 Nebel, Bernhard
Alle Artikel auflisten