To ensure the attack mission success rate, a trajectory with high survivability and accepted path length and multiple paths with different attack angles must be planned. This paper proposes a novel path planning algorithm based on orthogonal particle swarm optimization, which divides population individual and speed vector into independent orthogonal parts, velocity and individual part update independently, this improvement advances optimization effect of traditional particle swarm optimization in the field of path planning, multiple paths are produced by setting different attacking angles, this method is simulated on electronic chart, the simulation result shows the effect of this method.
A new path planning method for UAV in static workspace is presented. The method can find a nearly optimal path in
short time which satisfies the UAV kinematic constraints. The method makes use of the skeletons to construct the graph
of the planning space considering the configuration of the obstacles and utilizes the graph to find a shortest collision-free
path, and a novel technique is utilized to convert the free path into a feasible path. The method can be applied to different
applications and easy to be implemented. Experimental results showed that the path planning can be done in a fraction of
second on a contemporary workstation (2-3 seconds) under the condition of satisfying the kinematic constraints.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.