Loading...

Facility location optimization via multi-agent robotic systems

Moarref, M ; Sharif University of Technology | 2008

377 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICNSC.2008.4525227
  3. Publisher: 2008
  4. Abstract:
  5. A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. In this paper, distributed, asynchronous, and scalable algorithms are presented for solving a facility location problem known as continuous n-median problem (generalized Fermat-Weber problem) via multi-agent robotic systems. The algorithms are discussed both in continuous and discrete time domain, and their validity is proved. It is also shown that the solution of this facility location problem is the set of points that are the geometric medians of their corresponding Voronoi cells
  6. Keywords:
  7. Facilities ; Location ; Optimization ; Robotics ; Demand points ; Discrete time domains ; Facility location problems ; Facility locations ; Fermat-Weber problem ; International conferences ; Median problem ; Multi agents ; Optimization functions ; Robotic systems ; Scalable algorithms ; Voronoi cells ; Multi agent systems
  8. Source: 2008 IEEE International Conference on Networking, Sensing and Control, ICNSC, Sanya, 6 April 2008 through 8 April 2008 ; 2008 , Pages 287-292 ; 9781424416851 (ISBN)
  9. URL: https://ieeexplore.ieee.org/abstract/document/4525227