相关论文: Optimal Smooth Coverage Trajectory Planning for Qu…

Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to…

This work addresses the path planning problem for a group of unmanned aerial vehicles (UAVs) to maintain a desired formation during operation. Our approach formulates the problem as an optimization task by defining a set of fitness…

The integration of unmanned aerial vehicles (UAVs) into next-generation wireless networks is a promising solution for providing flexible, efficient coverage. This paper explores the optimal deployment of a single UAV to cover an arbitrary…

Unmanned Aerial Vehicle (UAV) networks have emerged as a promising technique to rapidly provide wireless coverage to a geographical area, where a flying UAV can be fast deployed to serve as cell site. Existing work on UAV-enabled wireless…

In this paper, the problem of trajectory design of unmanned aerial vehicles (UAVs) for maximizing the number of satisfied users is studied in a UAV based cellular network where the UAV works as a flying base station that serves users, and…

Robotic inspection of radioactive areas enables operators to be removed from hazardous environments; however, planning and operating in confined, cluttered environments remain challenging. These systems must autonomously reconstruct the…

This paper presents an autonomous navigation framework for reaching a goal in unknown 3D cluttered environments. The framework consists of three main components. First, a computationally efficient method for mapping the environment from the…

In this study, a single autonomous underwater vehicle (AUV) aims to rendezvous with a submerged leader recovery vehicle through a cluttered and variable operating field. The rendezvous problem is transformed into a nonlinear optimal control…

Autonomous flight of micro air vehicles (MAVs) in unknown, cluttered environments remains challenging for time-critical missions due to conservative maneuvering strategies. This article presents an integrated planning and control framework…

We consider an autonomous reconnaissance mission where an Unmanned Aerial Vehicle (UAV) has to visit several points of interest and communicate the intel back to the base. At every point of interest, the UAV has the option to either send…

By fully exploiting the mobility of unmanned aerial vehicles (UAVs), UAV-based aerial base stations (BSs) can move closer to ground users to achieve better communication conditions. In this paper, we consider a scenario where an aerial BS…

Aerial vehicles have recently attracted significant attention in a variety of commercial and civilian applications due to their high mobility, flexible deployment and cost-effectiveness. To leverage these promising features, the aerial…

The travelling salesman problem (TSP) of space trajectory design is complicated by its complex structure design space. The graph based tree search and stochastic seeding combinatorial approaches are commonly employed to tackle the…

This paper presents a novel approach to solving the Flying Sidekick Travelling Salesman Problem (FSTSP) using a state-of-the-art self-adaptive genetic algorithm. The Flying Sidekick Travelling Salesman Problem is a combinatorial…

This work addresses a route planning problem constrained by a bus road network that includes the schedules of all buses. Given a query with a starting bus stop and a set of Points of Interest (POIs) to visit, our goal is to find an optimal…

In real-time trajectory planning for unmanned vehicles, on-board sensors, radars and other instruments are used to collect information on possible obstacles to be avoided and pathways to be followed. Since, in practice, observations of the…

This paper investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive…

We give the first algorithmic study of a class of ``covering tour'' problems related to the geometric Traveling Salesman Problem: Find a polygonal tour for a cutter so that it sweeps out a specified region (``pocket''), in order to minimize…

Motivated by applications to poaching and burglary prevention, we define a class of weighted Traveling Salesman Problems on metric spaces. The goal is to output an infinite (though typically periodic) tour that visits the n points…

MPC (Model predictive control)-based motion planning and trajectory generation are essential in applications such as unmanned aerial vehicles, robotic manipulators, and rocket control. However, the real-time implementation of such…