Kartik Mohta

Kartik Mohta

Auto-generated profile, based on publicly available information

Kartik Mohta

GRASP Lab University of Pennsylvania Philadelphia PA USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 February 2017 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
SLSikang Liu
Sikang Liu
MWMichael Watterson
Michael Watterson
KMKartik Mohta
Kartik Mohta
KSKe Sun
Ke Sun
SBSubhrajit Bhattacharya
Subhrajit Bhattacharya
VKVijay Kumar
Vijay Kumar
There is extensive literature on using convex optimization to derive piece-wise polynomial trajectories for controlling differential flat systems with applications to three-dimensional flight for Micro Aerial Vehicles. In this work, we propose a method to formulate trajectory generation as a quadratic program (QP) using the concept of a Safe Flight Corridor (SFC). The SFC is a collection of convex overlapping polyhedra that models free space and provides a connected path from the robot to the goal position. We derive an efficient convex decomposition method that builds the SFC from a piece-wise linear skeleton obtained using a fast graph search technique. The SFC provides a set of linear inequality constraints in the QP allowing real-time motion planning. Because the range and field of view of the robot's sensors are limited, we develop a framework of Receding Horizon Planning , which plans trajectories within a finite footprint in the local map, continuously updating the trajectory through a re-planning process. The re-planning process takes between 50 to 300 ms for a large and cluttered map. We show the feasibility of our approach, its completeness and performance, with applications to high-speed flight in both simulated and physical experiments using quadrotors.

15 January 2018 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
KSKe Sun
Ke Sun
KMKartik Mohta
Kartik Mohta
BPBernd Pfrommer
Bernd Pfrommer
MWMichael Watterson
Michael Watterson
SLSikang Liu
Sikang Liu
VKVijay Kumar
Vijay Kumar
In recent years, vision-aided inertial odometry for state estimation has matured significantly. However, we still encounter challenges in terms of improving the computational efficiency and robustness of the underlying algorithms for applications in autonomous flight with micro aerial vehicles in which it is difficult to use high quality sensors and powerful processors because of constraints on size and weight. In this paper, we present a filter-based stereo visual inertial odometry that uses the Multi-State Constraint Kalman Filter (MSCKF) [1]. Previous work on stereo visual inertial odometry has resulted in solutions that are computationally expensive. We demonstrate that our Stereo Multi-State Constraint Kalman Filter (S-MSCKF) is comparable to state-of-art monocular solutions in terms of computational cost, while providing significantly greater robustness. We evaluate our S-MSCKF algorithm and compare it with state-of-art methods including OKVIS, ROVIO, and VINS-MONO on both the EuRoC dataset, and our own experimental datasets demonstrating fast autonomous flight with maximum speed of 17.5m/s in indoor and outdoor environments. Our implementation of the S-MSCKF is available at https://github.com/KumarRobotics/msckf_vio.

15 December 2017 in Journal of Field Robotics
Verified
Journal Article
Closed access
PDF file
KMKartik Mohta
Kartik Mohta
MWMichael Watterson
Michael Watterson
YMYash Mulgaonkar
Yash Mulgaonkar
SLSikang Liu
Sikang Liu
CQChao Qu
Chao Qu
VKVijay Kumar
Vijay Kumar

1 July 2018 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
SLSikang Liu
Sikang Liu
KMKartik Mohta
Kartik Mohta
NANikolay Atanasov
Nikolay Atanasov
VKVijay Kumar
Vijay Kumar
Quadrotors with large thrust-to-weight ratios are able to track aggressive trajectories with sharp turns and high accelerations. In this letter, we develop a search-based trajectory planning algorithm that exploits the quadrotor maneuverability to generate sequences of motion primitives in cluttered environments. We model the quadrotor body as an ellipsoid and compute its flight attitude along trajectories in order to check for collisions against obstacles. The ellipsoid model allows the quadrotor to pass through gaps that are smaller than its diameter with nonzero pitch or roll angles. Without any prior information about the location of gaps and associated attitude constraints, our algorithm is able to find a safe and optimal trajectory that guides the robot to its goal as fast as possible. To accelerate planning, we first perform a lower dimensional search and use it as a heuristic to guide the generation of a final dynamically feasible trajectory. We analyze critical discretization parameters of motion primitive planning and demonstrate the feasibility of the generated trajectories in various simulations and real-world experiments.

1 September 2017
Verified
Conference Paper
Closed access
SLSikang Liu
Sikang Liu
NANikolay Atanasov
Nikolay Atanasov
KMKartik Mohta
Kartik Mohta
VKVijay Kumar
Vijay Kumar
In this work, we propose a search-based planning method to compute dynamically feasible trajectories for a quadrotor flying in an obstacle-cluttered environment. Our approach searches for smooth, minimum-time trajectories by exploring the map using a set of short-duration motion primitives. The primitives are generated by solving an optimal control problem and induce a finite lattice discretization on the state space which can be explored using a graph-search algorithm. The proposed approach is able to generate resolution-complete (i.e., optimal in the discretized space), safe, dynamically feasibility trajectories efficiently by exploiting the explicit solution of a Linear Quadratic Minimum Time problem. It does not assume a hovering initial condition and, hence, is suitable for fast online re-planning while the robot is moving. Quadrotor navigation with online re-planning is demonstrated using the proposed approach in simulation and physical experiments and comparisons with trajectory generation based on state-of-art quadratic programming are presented.

8 August 2014 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
MTMatthew Turpin
Matthew Turpin
KMKartik Mohta
Kartik Mohta
NMNathan Michael
Nathan Michael
VKVijay Kumar
Vijay Kumar