Path Planning for Aviation Actuators in Deploying Regular Sensor Networks

The topology problem focusing on the coverage of sensor networks has been researched by many workers. These sensors can be dropped randomly using aircraft, or deployed by people who take them by vehicle to be positioned. For places that are hard to reach, deployment of sensors requires the use of manned or unmanned aircraft. Although the scattered sensors can be organized by a network protocol, it is more efficient if sensors are positioned regularly. This paper focuses on a path-planning algorithm that considers the performance of aircraft engines and the shortest time to position a sensor network. We propose a geometry-based path-planning algorithm (GPA) to plan a route that can navigate an aircraft to complete a mission. Simulation results show that the complexity and the memory required for the GPA are less than for the A* algorithm. The GPA can be used in path planning of aircraft to deploy regularly shaped sensor networks.