A node-to-node composite graph and pseudo-Boolean modelling: An unmanned aerial vehicle energy application

Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering

Volumn 221, Issue 5, 2007, Pages 815-830

  Economou, J T ^a   Kladis, G P ^a   Tsourdos, A ^a   White, B A ^a  

^a CRANFIELD UNIVERSITY   (United Kingdom)

Author keywords

Graph theory; Pseudo Boolean representation; Unmanned aerial vehicle

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DECISION MAKING; GRAPH THEORY; MATHEMATICAL MODELS;

ENERGY COSTS; PSEUDO BOOLEAN REPRESENTATION; TOPOLOGICAL LOCATIONS;

UNMANNED AERIAL VEHICLES (UAV);

EID: 36749020641     PISSN: 09544100     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544100JAERO191     Document Type: Article

References (40)

1. Economoum J. T., Colyer, R. E., and Zbikowski, R. W. Electric rotary actuator sizing applied to wheeled skid-steer vehicles. In Proceedings of the 38th IEEE Conference on Decision and Control, 1999, vol. 5, pp. 5271-5276.
2. Raiffa, H. Decision analysis: introductory lectures on choices under uncertainty, 1968 (Addison-Wesley, Reading, MA).
3. Richards, A. and How, J. P. Aircraft trajectory planning with collision avoidance using mixed integer linear programming. In Proceedings of the American Control Conference, 2002, pp. 1936-1941.
4. Rathinam, S. and Sengupta, R. A safe flight algorithm for unmanned aerial vehicles. In IEEE Aerospace Conference Proceedings, 2004, vol. 5, p. 3031.
5. Shanmugavel, M., Tsourdos, A., Zbikowski, R., White, B. A., Rabbath, C. A., and Lechevin, N. A solution to simultaneous arrival of multiple UAVS using Pythagorean hodograph curves. In Proceedings of American Control Conference, 2006, pp. 234-249.
6. Kirchoff, G. R. Über die Auflösung der Gleichungen, auf welce man bei den Untersuchungen der linearen Verteilung galvanische Ströme geführt wird. In Poggendorf Ann Physik, 1847, vol. 72, pp. 497-508.
7. Maxwell, J. C. Electricity and magnetism, 1892 (Clarendon, Oxford, UK).
8. Poincaré, H. Second complément á l'analysis situs. Proc. Lond. Math. Soc., 1900, 32, 277-308.
9. Veblen, O. and Franklin, P. On matrices whose elements are integers. Ann. Math., 1921/1922, 23, 1.
10. Veblen, O. The intersection of numbers. Trans. American Math. Soc., 1923, 25(4), 540-550.
11. Mason, S. J. Feedback theory: some properties of signal flow-graphs. In Proceedings of IRE, vol. 41, 1953, pp. 1144-1156.
12. Mason, S. J. Feedback theory: further properties of signal flow-graphs. In Proceedings of IRE, 1955, vol. 41, pp. 920-926.
13. Coates, C. L. Flow-graph solutions of linear algebraic equations. IRE Trans. Cirquit Theory, 1959, 6, 170-187.
14. Chan, S. P. and Mai, H. N. A flow-graph method for the analysis of linear systems. IEEE Trans. Cirquit Theory, 1967, 14, 350-354.
15. Gibbons, A. Algorithmic graph theory, 1994 (Cambridge University Press, Cambridge, UK).
16. Reinelt, G. The travelling salesman, computational solutions for TSP applications, 1994 (Springer-Verlag, Berlin).
17. Lawler, E., Lenstra, J., Rinnooy Kan, A., and Shmoys, D. The traveling salesman problem: a guided tour of combinatorial optimization, 1985 (Wiley, New York).
18. Moore, E. F. The shortest path through a maze. In Proceedings of the International Symposium on the Switching Theory 1957, Part II, 1957, pp. 285-292 (Harvard University Press).
19. Dijkstra, E. W. A note on two problems in connexion with graphs. Numen Math., 1959, 1, pp. 269-271.
20. Ford, L. R. J. Network flow theory, 1956, p. 923 (The Rand Corp., Santa Monica, CA).
21. Ford, L. R. J. and Fulkerson, D. R. Flows in networks, 1962, (Princeton University Press, Princeton, NJ).
22. Floyd, R. W. Algorithm 97: shortest path algorithm. J. ACM, 1962, 5, 345.
23. Onwubolu, G. C., Aborhey, S., Singh, R., Reddy, H., Prasad, M., Kumar, S. et al. Development of a PC-based computer numerical control drilling machine. Proc. Instn Mech. Engrs, Part B: J. Engineering Manufacture, 2002, 216(B6), 1509-1515.
24. Mehran, M. Formation flying control of multiple spacecraft via graphs, matrix inequalities and switching. J. Guid. Control Dyn., 2001, 24(2), 369-377.
25. Minieka, E. The Chinese postman problem for mixed networks. Manage. Sci., 1979, 25, 643-648.
26. Guan, M. On the windy postman problem. Discrete Appl Math., 1984, 9, 41-46.
27. Win, Z. On the windy postman problem on Eulerian graphs. Math. Program, 1989, 44, 97-112.
28. Pearn, W. L. and Li, M. L. Algorithms for the windy postman problem. Comput. Open Res., 1994, 21(6), 641-651.
29. Levy, L. and Bodin, L. Scheduling in the postal cariers for the United States postal service: an application of arc partitioning and routing. In Vehicle routing; methods and studies, 1988, pp. 359-394 (North Holland, Amsterdam).
30. Holt, J. N. and Watts, A. M. Vehicle routing and scheduling in the newspaper industry. In Vehicle routing: methods and studies, 1988, pp. 347-358 (North Holland, Amsterdam).
31. Beltrami, E. and Bodin, L. Networks and vehicle routing for municipal waste collection. Networks, 1974, 4(1), 65-94.
32. Desrosiers, J., Ferland, J. A., Rousseau, J. M., Lapalme, G., and Chapleau, L. An overview of a school busing system. In Scientific management on transport systems, 1988, pp. 235-243 (North Holland, Amsterdam).
33. Eglese, R. W. Routing winter gritting vehicles. Discrete Appl Math., 1992, 48, 88-124.
34. Eglese, R. W. and Li, L. Y. O. Efficient routing for winter gritting. J. Open Res. Soc., 1992, 43(11), 1031-1034.
35. Stern, H. I. and Dror, M. Routing electric meter readers. Comput. Open Res., 1979, 6, 209-223.
36. Zhipu, J., Shima, T., and Schumacher, C. J. Optimal scheduling for refueling multiple autonomous aerial vehicles. IEEE Trans. Robot., 2006, 22(4), 682-693.
37. Shen, H. and Tsiotras, P. Optimalschedulingforservicing multiple satellites in a circular constellations. AIAA paper 2002-4907, 2002.
38. Shen, H. and Tsiotras, P. Peer-to-peer refueling for circular satellite constellations. J. Guid. Control Dyn., 2005, 28(6), 1220-1230.
39. Edmonds, J. and Johnson, E. Matching: a well-solved class of integer linear programs. In Proceedings of Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, pp. 89-92.
40. Boros, E. and Hammer, P. L. Pseudo-Boolean optimization. Discrete Appl. Math., 2002, 123(1-3), 155-225.