Increasingly, robotic systems require a level of perception of the scenario to interact in real-time, but they also require specialized equipment such as sensors to reach high performance standards adequately. Therefore, it is essential to explore alternatives to reduce the costs for these systems. For example, a common problem attempted by intelligent robotic systems is path planning. This problem contains different subsystems such as perception, location, control, and planning, and demands a quick response time. Consequently, the design of the solutions is limited and requires specialized elements, increasing the cost and time development. Secondly, virtual reality is employed to train and evaluate algorithms, generating virtual data. For this reason, the virtual dataset can be connected with the authentic world through Generative Adversarial Networks (GANs), reducing time development and employing limited samples of the physical world. To describe the performance, metadata information details the properties of the agents in an environment. The metadata approach is tested with an augmented reality system and a micro aerial vehicle (MAV), where both systems are executed in an authentic environment and implemented in embedded devices. This development helps to guide alternatives to reduce resources and costs, but external factors limit these implementations, such as the illumination variation, because the system depends on only a conventional camera.
This work presents a novel path-planning approach for Unmanned Aerial Vehicles (UAVs) in continuous 3D environments. This proposal aims to minimize the path length while avoiding collisions through the suitable adjusting of control points (the points that take the UAV from a start position to a target location). The above is stated as a constrained global optimization problem. This problem considers the overall length of the path as the single objective function. Regarding the problem constraints, they are related to the collision of the obstacles with the 3D shape of a path. The assignment of the path shape is also proposed in this work to streamline the planning process. Due to the optimization problem features (high nonlinearity, multimodality, non-differentiability, and the lack of an initial guess solution), a constraintshandling mechanism is used in meta-heuristics to find suitable optimized paths. Also, an enhanced pathsearch mechanism is included in these algorithms to deal with complex planning scenarios. The enhanced mechanism incorporates a path computed by a variant of the A-Star method (the Pruned A-Star) in the first set of candidate solutions of the meta-heuristics. The proposed approach is tested through six complex scenarios. Moreover, the performance of three well-known meta-heuristics, Differential Evolution (DE), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA), is studied to find a potential candidate to solve the path-planning problem. In this way, the paths found by DE show outstanding performance. The paths obtained by the Pruned A-Star technique are adopted as a point of comparison to determine the advantages and drawbacks of the proposal. INDEX TERMS Path-planning, optimization problem, aerial vehicles, meta-heuristics, continuous spaces.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.