{"id":1141,"date":"2018-08-30T09:38:01","date_gmt":"2018-08-30T17:38:01","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1141"},"modified":"2018-08-30T09:38:01","modified_gmt":"2018-08-30T17:38:01","slug":"optimal-path-planning-for-establishing-connectivity-in-proximity-networks","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/optimal-path-planning-for-establishing-connectivity-in-proximity-networks\/","title":{"rendered":"Optimal path planning for establishing connectivity in proximity networks"},"content":{"rendered":"

R. Dai, J. Maximoff, M. Mesbahi<\/strong><\/p>\n

IEEE Transactions on Aerospace and Electronic Systems<\/strong><\/p>\n

\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n

We examine the problem of designing optimal trajectories to establish connectivity in a network of initially scattered dynamic agents, specifically minimizing the squared integral of the total control effort. The network edges are modeled by proximity relationships between endpoint agents, leading to a dynamic state-dependent network topology. We formulate an optimal control problem with specified initial states, linear dynamics, and a connectivity constraint on the final induced topology. Our approach utilizes the Hamiltonian and resultant Euler-Lagrange equations to restructure the optimal control formulation as a parameter optimization problem based on final agent states. We provide both a heuristic approach and an iterative semidefinite programming (SDP) relaxation to efficiently approximate a solution of the resulting combinatorial optimization problem. Simulation results for double integrator agent dynamics are first provided to demonstrate feasibility for both approaches, and the results are compared with those obtained from exhaustive global search and random sampling. Additional simulation is performed for a specific spacecraft formation problem requiring the design of a stable connected network between a collection of fractionated spacecraft modules to illustrate the practicability and indicate the range of applications of the proposed approaches.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

<\/div>\n

Links:<\/strong><\/p>\n

\"\"<\/a> \u00a0 \"\"<\/a> \u00a0 \"\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

R. Dai, J. Maximoff, M. Mesbahi IEEE Transactions on Aerospace and Electronic Systems We examine the problem of designing optimal trajectories to establish connectivity in a network of initially scattered dynamic agents, specifically minimizing the squared integral of the total control effort. The network edges are modeled by proximity relationships between endpoint agents, leading to […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1141"}],"collection":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/comments?post=1141"}],"version-history":[{"count":1,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1141\/revisions"}],"predecessor-version":[{"id":1142,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1141\/revisions\/1142"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1141"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}