| BLOCK COMPRESSION AND INVARIANT PRUNING FOR SAT-BASED TOTALLY-ORDERED HTN PLANNING
|
2021 |
Behnke, Gregor |
| S*: A HEURISTIC INFORMATION-BASED APPROXIMATION FRAMEWORK FOR MULTI-GOAL PATH FINDING
|
2021 |
Chour, Kenny |
| OMCORP: AN ONLINE MECHANISM FOR COMPETITIVE ROBOT PRIORITIZATION
|
2021 |
Das, Sankar Narayan |
| DELETE-RELAXATION HEURISTICS FOR LIFTED CLASSICAL PLANNING
|
2021 |
Corréa, Augusto B. |
| SUBSET-SATURATED TRANSITION COST PARTITIONING
|
2021 |
Drexler, Dominik |
| LM-CUT AND OPERATOR COUNTING HEURISTICS FOR OPTIMAL NUMERIC PLANNING WITH SIMPLE CONDITIONS
|
2021 |
Kuroiwa, Ryo |
| TRANSLATIONS FROM DISCRETISED PDDL+ TO NUMERIC PLANNING
|
2021 |
Percassi, Francesco |
| NON-DETERMINISTIC CONFORMANT PLANNING USING A COUNTEREXAMPLE- GUIDED INCREMENTAL COMPILATION TO CLASSICAL PLANNING
|
2021 |
Scala, Enrico |
| DISTRIBUTED FAIR SCHEDULING FOR INFORMATION EXCHANGE IN MULTI-AGENT SYSTEMS
|
2021 |
Raeis, Majid |
| SITUATED TEMPORAL PLANNING USING DEADLINE-AWARE METAREASONING
|
2021 |
Shperberg, Shahaf S. |
| ON THE COMPILABILITY AND EXPRESSIVE POWER OF STATE-DEPENDENT ACTION COSTS
|
2021 |
Speck, David |
| APPROXIMATE NOVELTY SEARCH
|
2021 |
Singh, Anubhav |
| SCHEDULING STOCHASTIC JOBS - COMPLEXITY AND APPROXIMATION ALGORITHMS
|
2021 |
Tao, Liangde |
| PRIVACY-PRESERVING ALGORITHM FOR DECOUPLING OF MULTI-AGENT PLANS WITH UNCERTAINTY
|
2021 |
Zhang, Yuening |
| AUTONOMOUS BUILDING OF STRUCTURES IN UNSTRUCTURED ENVIRONMENTS VIA AI PLANNING
|
2021 |
Roberts, Jamie O. |
| DEEPFREIGHT: A MODEL-FREE DEEP-REINFORCEMENT-LEARNING-BASED ALGORITHM FOR MULTI-TRANSFER FREIGHT DELIVERY
|
2021 |
Chen, Jiayu |
| INTEGRATING KNOWLEDGE COMPILATION WITH REINFORCEMENT LEARNING FOR ROUTES
|
2021 |
Ling, Jiajing |
| META REINFORCEMENT LEARNING FOR HEURISTIC PLANING
|
2021 |
Gutierrez, Ricardo Luna |
| DATA-DRIVEN DECISION-THEORETIC PLANNING USING RECURRENT SUM-PRODUCT-MAX NETWORKS
|
2021 |
Tatavarti, Hari |
| TASK-AWARE WAYPOINT SAMPLING FOR ROBOTIC PLANNING
|
2021 |
Keren, Sarah |
Tag hinzufügen