← Search

Suman Chakravorty

9 accepted papers

2017

MT-LQG: Multi-agent planning in belief space via trajectory-optimized LQG

ICRA 2017poster

Belief space planning is concerned with the problem of finding the control policy under process and measurement uncertainties. Formulated as a stochastic control problem, the solution of a general Decentralized Partially Observed Markov Decision Process (Dec-POMDP) is a collection of feedback polici…

Cited by 3SourceScholar
2017

RFM-SLAM: Exploiting relative feature measurements to separate orientation and position estimation in SLAM

ICRA 2017poster

The SLAM problem is known to have a special property that when robot orientation is known, estimating the history of robot poses and feature locations can be posed as a standard linear least squares problem. In this work, we develop a SLAM framework that uses relative feature-to-feature measurements…

Cited by 15SourceScholar
2017

T-LQG: Closed-loop belief space planning via trajectory-optimized LQG

ICRA 2017poster

Planning under motion and observation uncertainties requires the solution of a stochastic control problem in the space of feedback policies. In this paper, by restricting the policy class to the linear feedback polices, we reduce the general (n2 + n)-dimensional belief space planning problem to an (…

Cited by 23SourceScholar
2016

Feedback motion planning under non-Gaussian uncertainty and non-convex state constraints

ICRA 2016

Planning under process and measurement uncertainties is a challenging problem. In its most general form, it can be modeled as a Partially Observed Markov Decision Process (POMDP) problem. However POMDPs are generally difficult to solve when the underlying spaces are continuous, particularly when bel

Cited by 14SourceScholar
2016

Unifying consensus and covariance intersection for decentralized state estimation

IROS 2016poster

This paper presents a new recursive information consensus filter for decentralized dynamic-state estimation. Local estimators are assumed to have access only to local information and no structure is assumed about the topology of the communication network, which need not be connected at all times. It…

Cited by 7SourceScholar