Abstract
We identify a novel class of distributed optimization problems, namely a networked version of abstract linear programming. For such problems we propose distributed algorithms for networks with various connectivity and/or memory constraints. Finally, we show how a suitable target localization problem can be tackled through appropriate linear programs.
This material is based upon work supported in part by ARO MURI Award W911NF-05-1-0219 and ONR Award N00014-07-1-0721. The research leading to these results has received funding from the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 224428 (CHAT Project).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Matousek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4/5), 498–516 (1996)
Gärtner, B.: A subexponential algorithm for abstract optimization problems. SIAM Journal on Computing 24(5), 1018–1035 (1995)
Notarstefano, G., Bullo, F.: Network abstract linear programming with application to minimum-time formation control. In: IEEE Conf. on Decision and Control, New Orleans, December 2007, pp. 927–932 (2007)
Megiddo, N.: Linear programming in linear time when the dimension is fixed. Journal of the Association for Computing Machinery 31(1), 114–127 (1984)
Gärtner, B., Welzl, E.: Linear programming - randomization and abstract frameworks. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 669–687. Springer, Heidelberg (1996)
Goldwasser, M.: A survey of linear programming in randomized subexponential time. SIGACT News 26(2), 96–104 (1995)
Agarwal, P.K., Sen, S.: Randomized algorithms for geometric optimization problems. In: Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J. (eds.) Handbook of Randomization. Kluwer Academic Publishers, Dordrecht (2001)
Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Surveys 30(4), 412–458 (1998)
Ajtai, M., Megiddo, N.: A deterministic \({\operatorname{poly}}(\log \log n)\)-time n-processor algorithm for linear programming in fixed dimension. SIAM Journal on Computing 25(6), 1171–1195 (1996)
Zhao, F., Guibas, L.: Wireless Sensor Networks: An Information Processing Approach. Morgan Kaufmann, San Francisco (2004)
Garruli, A., Vicino, A.: Set membership localization of mobile robots via angle measurements. IEEE Transactions on Robotics and Automation 17(4), 450–463 (2001)
Isler, V., Bajcsy, R.: The sensor selection problem for bounded uncertainty sensing models. IEEE Transactions on Automation Sciences and Engineering 3(4), 372–381 (2006)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)
Bullo, F., Cortés, J., Martínez, S.: Distributed Control of Robotic Networks. Applied Mathematics Series. Princeton University Press, Princeton (2008) (manuscript under contract), http://www.coordinationbook.info
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Notarstefano, G., Bullo, F. (2009). Network Abstract Linear Programming with Application to Cooperative Target Localization. In: Chiuso, A., Fortuna, L., Frasca, M., Rizzo, A., Schenato, L., Zampieri, S. (eds) Modelling, Estimation and Control of Networked Complex Systems. Understanding Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03199-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-03199-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03198-4
Online ISBN: 978-3-642-03199-1
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)