3 accepted papers
Multirotor aerial vehicles (MAVs) in confined, dynamic indoor environments need reliable planning capabilities to avoid moving pedestrians. Current MAV trajectory planning algorithms often result in low success rates or unnecessary constraints on navigable space. We propose a multi-stage local traje
The minimum vertex cover (MVC) problem is a classic NP-hard combinatorial optimization problem with extensive real-world applications. In this paper, we propose an efficient local search algorithm, InfVC, to solve the MVC in massive graphs, which comprises three ideas. First, we introduce an inferen
As fully-actuated systems, omnidirectional multirotor aerial vehicles (OMAVs) have more flexible maneuverability and advantages in aggressive flight in cluttered environments than traditional underactuated MAVs. This letter aims to achieve safe flight of OMAVs in cluttered environments. We present a