Modelling of time-to collision for unmanned aerial vehicle using particles swarm optimization

Abstract

A method for the development of Time-to-Collision (TTC) mathematical model for outdoor Unmanned Aerial Vehicle (UAV) using Particles Swarm Optimization (PSO), are presented. TTC is the time required for a UAV either to collide with any static obstacle or completely stop without applying any braking control system when the throttle is fully released. This model provides predictions of time before UAV will collide with the obstacle in the same path based on their parameter, for instance, current speed and payload. However, this paper focus on the methodology of the implementation of PSO to develop the TTC model for 5 different set of payloads. This work utilizes a quadcopter as our testbed system, that equipped with a Global Positioning System (GPS) receiver unit, a flight controller with data recording capability and ground control station for real-time monitoring. The recorded onboard flight mission data for 5 different set of payloads has been analyzed to develop a mathematical model of TTC through the PSO approach. The horizontal ground speed, throttle magnitudes and flight time stamp are extracted from the on-board quadcopter flight mission. PSO algorithm is used to find the optimal linear TTC model function, while the mean square error is used to evaluate the best fitness of the solution. The results of the TTC mathematical model for each payload are described.

Low-cost portable throttle curve manipulator for smooth initial movement of an electric vehicle

“…Therefore, a feedback force is displayed to increase the user's comfort in using the brake-by-wire system. Other research reports a time-to-collision calculation to stop an electric vehicle by releasing the throttle without any applied braking force [26]. As a result, the stopping action becomes smoother and more comfortable for the user on board.…”

Child tracking system using smartphone

“…There are several factors that lead to this incident to happen. One of it is because of the parents could not supervise their children all the time [7], [8]. Kidnapping or abduction can happen anywhere and anytime whether in a shopping mall, supermarket, playground and even in their  ISSN: 2302-9285 own house.…”

Solving the order batching and sequencing problem with multiple pickers: A grouped genetic algorithm

“…The order batching problem is considered NP-Hard when the number of customer orders per batch is greater than two [15], which means it is impossible to obtain a polynomial-time solution for it [16], therefore, this type of problem requires to be solved using approximate methods such as metaheuristics [17,18], among which the particle swarm optimization [19], ant colony optimization [20], genetic algorithms (GA) [21], among others, can be mentioned. Specifically, group-oriented genetic algorithms (GGA) support the successful application to grouping problems because critical information from the chromosome is preserved and is correctly transferred in the crossover operators [22].…”