Hybrid Heuristic Online Planning for POMDPs

DOI10.3724/SP.J.1001.2013.04318MaRDI QIDQ5166000zbMATH OpenOpenAlexFDO

Authors Zongzhang Zhang, Xiaoping Chen

Publication date 30 June 2014

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2013.04318

zbMATH Keywords

Markov decision processhybrid heuristicsonline planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)

Recommendations

• Online planning algorithms for POMDPS
• Online speedup learning for optimal planning
• Scalable Online Planning for Multi-Agent MDPs
• A heuristic search approach to planning with continuous resources in stochastic domains
• Planning in hybrid relational MDPs
• DESPOT: online POMDP planning with regularization
• Point-Based Online Value Iteration Algorithm for POMDPs

Cited in

(7)

• Online speedup learning for optimal planning
• Online planning algorithms for POMDPS
• A heuristic search approach to planning with continuous resources in stochastic domains
• Human-aware contingent planning
• Motion planning under uncertainty for robotic tasks with long time horizons
• DESPOT: online POMDP planning with regularization
• Robotic manipulation of multiple objects as a POMDP

This page was built for publication: Hybrid Heuristic Online Planning for POMDPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166000)