Thomas Wheeler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Thomas Wheeler has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Dimitri P. Bertsekas
M.I.T.
1 shared publication - Sahil Badyal
REACT Lab, Cambridge, MA, USA
1 shared publication - Stephanie Gil
School of Engineering and Applied Sciences, Harvard University, Allston, MA, USA
1 shared publication - Sushmita Bhattacharya
Project CETI, New York, NY, USA
1 shared publication
Latest Publications
- 4 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 5 (3) , 3967-3974
Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration With Application to Autonomous Sequential Repair Problems
In this paper we consider infinite horizon discounted partial observation dynamic programming problems with finite state and control spaces. We discuss an algorithm that uses multistep lookahead, truncated rollout with a known base policy, and a terminal cost function approximation. This algorithm is also used for policy improvement in an approximate policy iteration scheme, where successive policies are approximated by using a neural network classifier. A novel feature of our approach is that it is well suited for distributed computation through an extended belief space formulation and the use of a partitioned architecture, which is trained with multiple neural networks. We apply our methods in simulation to a class of sequential repair problems where a robot inspects and repairs a pipeline with potentially several rupture sites under partial information about the state of the pipeline.
- 4 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 5 (3) , 3967-3974
Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration With Application to Autonomous Sequential Repair Problems
In this paper we consider infinite horizon discounted partial observation dynamic programming problems with finite state and control spaces. We discuss an algorithm that uses multistep lookahead, truncated rollout with a known base policy, and a terminal cost function approximation. This algorithm is also used for policy improvement in an approximate policy iteration scheme, where successive policies are approximated by using a neural network classifier. A novel feature of our approach is that it is well suited for distributed computation through an extended belief space formulation and the use of a partitioned architecture, which is trained with multiple neural networks. We apply our methods in simulation to a class of sequential repair problems where a robot inspects and repairs a pipeline with potentially several rupture sites under partial information about the state of the pipeline.