Chetan D. Pahlajani

dblp:87/10334 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 91% Robot navigation and mapping · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › robot control › optimal control
receding horizon control
0.112012
Stochastic receding horizon control for robots with probabilistic state constraints · ICRA 2012
Robotics › Motion planning and robot control
robot control
0.112012
Stochastic receding horizon control for robots with probabilistic state constraints · ICRA 2012
Robotics › Motion planning and robot control
stochastic optimal control
0.112012
Stochastic receding horizon control for robots with probabilistic state constraints · ICRA 2012
Robotics › Robot navigation and mapping › obstacle avoidance
collision-free navigation
0.012012
Stochastic receding horizon control for robots with probabilistic state constraints · ICRA 2012

Methods — techniques the papers use, named apart from their topics

stochastic optimal control · 0.1hamilton-jacobi-bellman · 0.1
YearPublicationVenuePosition
2012 Stochastic receding horizon control for robots with probabilistic state constraints
abstract
This paper presents a receding horizon control design for a robot subject to stochastic uncertainty, moving in a constrained environment. Instead of minimizing the expectation of a cost functional while ensuring satisfaction of probabilistic state constraints, we propose a two-stage solution where the path that minimizes the cost functional is planned deterministically, and a local stochastic optimal controller with exit constraints ensures satisfaction of probabilistic state constraints while following the planned path. This control design strategy ensures boundedness of errors around the reference path and collision-free convergence to the goal with probability one under the assumption of unbounded inputs. We show that explicit expressions for the control law are possible for certain cases. We provide simulation results for a point robot moving in a constrained two-dimensional environment under Brownian noise. The method can be extended to systems with bounded inputs, if a small nonzero probability of failure can be accepted.
Shridhar K. Shah, Chetan D. Pahlajani, Nicholaus A. Lacock, Herbert G. Tanner
ICRA2
2011 Probability of success in stochastic robot navigation with state feedback
abstract
The analysis in this paper applies to robots with dynamics described by a stochastic differential equation, which need to navigate in constrained environments. The approach offers a method to calculate the probability that a feedback control policy designed for the drift component of the dynamics, will succeed in allowing the robot to avoid collisions and converge to its navigation goal in the presence of stochastic (white) noise. The problem is formulated as an exit problem and known techniques in the field of stochastic processes are brought to bear to determine the probabilities that the stochastic process describing the motion of the robot will ¿exit¿ the workspace through a particular part of the boundary. We motivate the use of this analysis using a controller constructed using negative gradient of a navigation function and give the analytic solution for the case of a constrained but obstacle-free workspace.
Shridhar K. Shah, Chetan D. Pahlajani, Herbert G. Tanner
IROS2