← Search

Satyanarayana G. Manyam

6 accepted papers

2025

Hybrid Theta$*$: Motion Planning for Dubins Vehicles With Integral Constraints

RA-L 2025

We consider a motion planning problem for vehicles with curvature constraints, such as minimum turn radius, and a secondary cost such as resource cost. Traditional motion planning problems address the secondary cost as a soft constraint within the cost function. In the current paper, we take a diffe

Cited by 2SourceScholar
2022

Path Planning and Energy Management of Hybrid Air Vehicles for Urban Air Mobility

RA-L 2022

A novel coupled path planning and energy management problem for a hybrid unmanned air vehicle is considered, where the hybrid vehicle is powered by a dual gas/electric system. Such an aerial robot is envisioned for use in an urban setting where noise restrictions are in place in certain zones necess

Cited by 13SourceScholar
2021

Trajectory Optimization For Rendezvous Planning Using Quadratic Bézier Curves

IROS 2021poster

In this paper, we consider a trajectory planning problem where an autonomous vehicle aims to rendezvous with another cooperating vehicle in minimum time. The first vehicle has kinematic constraints, consequently feasible trajectories must have a maximum curvature less than a specified limit. Rendezv…

Cited by 20SourceScholar
2020

Persistent Intelligence, Surveillance, and Reconnaissance Using Multiple Autonomous Vehicles With Asynchronous Route Updates

RA-L 2020

Providing persistent intelligence, reconnaissance, and surveillance of targets is a challenging, but important task when time-critical information is required. In this letter, we provide a decentralized routing algorithm for coordinating multiple autonomous vehicles as they visit a discrete set of p

Cited by 18SourceScholar
2019

Near-Optimal Path Planning for a Car-Like Robot Visiting a Set of Waypoints With Field of View Constraints

RA-L 2019

This letter considers two variants of a shortest path problem for a car-like robot visiting a set of waypoints. The sequence of waypoints to be visited is specified in the first variant while the robot is allowed to visit the waypoints in any sequence in the second variant. The shortest path problem

Cited by 16SourceScholar