Bio-inspired varying subspace based computational framework for a class of nonlinear constrained optimal trajectory planning problems
Source abstract
Abstract
Biological species have produced many simple but efficient rules in their complex and critical survival activities such as hunting and mating. A common feature observed in several biological motion strategies is that the predator only moves along paths in a carefully selected or iteratively refined subspace (or manifold), which might be able to explain why these motion strategies are effective. In this paper, a unified linear algebraic formulation representing such a predator-prey relationship is developed to simplify the construction and refinement process of the subspace (or manifold). Specifically, the following three motion strategies are studied and modified: motion camouflage, constant absolute target direction and local pursuit. The framework constructed based on this varying subspace concept could significantly reduce the computational cost in solving a class of nonlinear constrained optimal trajectory planning problems, particularly for the case with severe constraints. Two non-trivial examples, a ground robot and a hypersonic aircraft trajectory optimization problem, are used to show the capabilities of the algorithms in this new computational framework.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Robotic Path Planning Algorithms · Guidance and Control Systems · Distributed Control Multi-Agent Systems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (36)
Show source-provided references
1. 10.2514/1.2047810.2514/1.20478 ↗
2. Betts J · Practical Methods for Optimal Control Using Nonlinear Programming · 2001
3. 10.2514/3.4409310.2514/3.44093 ↗
4. Btavia P H · IEEE/RSJ Int. Conf. on Intelligent Robots and Systems · 2000 · 15
5. Camazine S · Self-Organization in Biological Systems · 2001
6. 10.2507/IJSIMM06(3)2.08710.2507/IJSIMM06(3)2.087 ↗
7. 10.2514/6.2010-788810.2514/6.2010-7888 ↗
8. 10.2514/1.3932710.2514/1.39327 ↗
9. 10.2514/2.470910.2514/2.4709 ↗
10. 10.1371/journal.pbio.004010810.1371/journal.pbio.0040108 ↗
11. 10.1007/s10846-009-9383-110.1007/s10846-009-9383-1 ↗
12. 10.1007/s10589-007-9102-410.1007/s10589-007-9102-4 ↗
13. 10.1137/103704310.1137/1037043 ↗
14. 10.1080/0020717041233133009810.1080/00207170412331330098 ↗
15. 10.1016/j.automatica.2006.12.02310.1016/j.automatica.2006.12.023 ↗
16. 10.1007/s10589-007-9098-910.1007/s10589-007-9098-9 ↗
17. 10.1109/70.50843910.1109/70.508439 ↗
18. 10.2514/3.2163410.2514/3.21634 ↗
19. 10.1007/BFb003606910.1007/BFb0036069 ↗
20. 10.1177/0278364012206745310.1177/02783640122067453 ↗
21. 10.2514/3.2070310.2514/3.20703 ↗
22. 10.1109/TRO.2006.87878910.1109/TRO.2006.878789 ↗
23. Nusyirwan I F · Proc. IEEE Information, Decision, and Control Conf. · 2007 · 219
24. 10.1196/annals.1311.01310.1196/annals.1311.013 ↗
25. 10.1007/s00359005001510.1007/s003590050015 ↗
26. 10.1023/A:101656830942110.1023/A:1016568309421 ↗
27. 10.1007/978-3-642-59223-210.1007/978-3-642-59223-2 ↗
28. Pontryagin L S · The Mathematical Theory of Optimal Processes · 1962
29. 10.1016/j.nonrwa.2010.02.01010.1016/j.nonrwa.2010.02.010 ↗
30. Ridder S D · 2009
31. 10.1098/rspb.1995.000410.1098/rspb.1995.0004 ↗
32. 10.2514/1.4869110.2514/1.48691 ↗
33. 10.1016/j.automatica.2010.05.02710.1016/j.automatica.2010.05.027 ↗
34. 10.1016/j.automatica.2012.05.01710.1016/j.automatica.2012.05.017 ↗
35. 10.2514/1.2659110.2514/1.26591 ↗
36. 10.1109/ROBIO.2007.452231110.1109/ROBIO.2007.4522311 ↗