Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks

Valle, Cristiano Arbex; Cunha, Alexandre Salles da; Aioffi, Wagner Moro; Mateus, Geraldo Robson

doi:10.1145/1454503.1454545

Cited by 5 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In ref. [98], the authors also used a model that refers to the EGTSP however, after the sensor nodes were grouped, the path generated did not necessarily pass through the exact position of a node, but on virtual points calculated in the center of the previously defined groups.…”

Section: Vehicle Routing For Visiting Regionsmentioning

confidence: 99%

A survey on routing problems and robotic systems

Macharet¹,

Campos²

2018

Robotica

View full text Add to dashboard Cite

SUMMARYPlanning paths that are length or time optimized or both is an age-long problem for which numerous approaches have been proposed with varied degree of success depending on the imposed constraints. Among classical instances in the literature, the Traveling Salesman Problem and the Vehicle Routing Problem have been widely studied and frequently considered in the realm of mobile robotics. Understandably, the classical formulation for such problems do not take into account many different issues that arise in real-world scenarios, such as motion constraints and dynamic environments, commonly found in actual robotic systems, and consequently the solutions have been generalized in several ways. In this work, we present a broad and comprehensive review of the classical works and recent breakthroughs regarding the routing techniques ordinarily used in robotic systems and provide references to the most fundamental works in the literature.

show abstract

Section: Vehicle Routing For Visiting Regionsmentioning

confidence: 99%