conftrace_

online planning

37 papers

Explore in graph

Co-occurring keywords

partially observable markov decision process (178) belief state (75) tree search (86) pomdp planning (11) markov decision process (790) particle filter (86) monte-carlo tree search (37) monte carlo tree search (271) monte carlo simulation (25) value iteration (162)

Papers

Online Robust Planning Under Model Uncertainty: A Sample-Based Approach AAAI 2026
A General Highly Accurate Online Planning Method Integrating Large Language Models into Nested Rollout Policy Adaptation for Dialogue Tasks AAAI 2026
Efficient Multi-Agent Collaboration with Tool Use for Online Planning in Complex Table Question Answering NAACL 2025
Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach AAAI 2025
Partially Observable Reference Policy Programming IJCAI 2025
Online Planning in MDPs with Stochastic Durative Actions IJCAI 2025
Factored Online Planning in Many-Agent POMDPs AAAI 2024
A Surprisingly Simple Continuous-Action POMDP Solver: Lazy Cross-Entropy Search Over Policy Trees AAAI 2024
Optimality Guarantees for Particle Belief Approximation of POMDPs (Abstract Reprint) IJCAI 2024
Information-guided Planning: An Online Approach for Partially Observable Problems NIPS 2023
Online Planning in POMDPs with Self-Improving Simulators IJCAI 2022
Optimal Pointing Sequences in Spacecraft Formation Flying Using Online Planning with Resource Constraints L4DC 2022
PDSketch: Integrated Domain Programming, Learning, and Planning NIPS 2022
MAGIC: Learning Macro-Actions for Online POMDP Planning RSS 2021
Adaptive Online Packing-guided Search for POMDPs NIPS 2021
Learning Off-Policy with Online Planning CORL 2021
Scalable Online Planning via Reinforcement Learning Fine-Tuning NIPS 2021
LB-DESPOT: Efficient Online POMDP Planning Considering Lower Bound in Action Selection (Student Abstract) AAAI 2021
Influence-Augmented Online Planning for Complex Environments NIPS 2020
Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints RSS 2020
Bayesian Reinforcement Learning via Deep, Sparse Sampling AISTATS 2020
Online Planning with Lookahead Policies NIPS 2020
Efficient Planning Under Uncertainty with Incremental Refinement UAI 2019
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests UAI 2019
Deep Dynamics Models for Learning Dexterous Manipulation CORL 2019