Collecting Information by Power-Aware Mobile Agents

Anaya, Julian; Chalopin, Jérémie; Czyzowicz, Jurek; Labourel, Arnaud; Pełc, Andrzej; Vaxès, Yann

doi:10.1007/978-3-642-33651-5_4

Cited by 11 publications

(19 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are very few papers studying explicitly the algorithmic question of dataaggregation-like problems by mobile agents with limited batteries. Besides the already mentioned paper by Chalopin et al [5], the work of Anaya et al [3] comes closest to our problem. Anaya et al [3] study the convergecast problem: given a set of mobile agents in an edge-weighted graph, each agent possessing a certain piece of data, and having a uniform battery power B, the agents need to move, not more than what the battery allows, such that at some point at least one agent knows all data.…”

Section: Related Worksupporting

confidence: 55%

“…Rj }-resource augmented algorithm has been presented; here, a polynomial-time algorithm is called a γ-resource augmented, γ > 1, if either the algorithm (correctly) answers that there is no feasible schedule, or it finds a feasible schedule for the modified (augmented) powers R i := γ • R i . The complexity of the problem for the case when the graph is a line has been left open (it has been raised as an open question by Anaya et al [3], but not studied).…”

Section: Rimentioning

confidence: 99%

“…Obviously, it makes no sense for an agent to carry the message more than once. Then, even though the agents can in principle move simultaneously at a time, it is easy to observe that for the sake of completing the task only, 3 the agents can move in turns: in the first turn, the agent picking up the message at s moves; then, the agent taking over from the first agent moves; then, the agent taking over from the second agent moves, and so on. In this view, a solution to DataDelivery can be given in form of a schedule that prescribes the subset of the agents that move and the order in which they move.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Data Delivery by Energy-Constrained Mobile Agents on a Line

Chalopin

Jacob

Mihaľák

et al. 2014

Automata, Languages, and Programming

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Related Worksupporting

confidence: 55%

Section: Rimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Data Delivery by Energy-Constrained Mobile Agents on a Line

Chalopin

Jacob

Mihaľák

et al. 2014

Automata, Languages, and Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…This problem is proven to be N P -complete in [11] already for line networks, if the initial energy values may be distinct for different agents. However, in the setting studied in [1,11], the agents do not exchange energy. In the present paper we show that the situation is quite different if the agents are allowed to transfer energy between one another.…”

Section: Related Workmentioning

confidence: 99%

Communication Problems for Mobile Agents Exchanging Energy

Czyzowicz

Diks

Moussi

et al. 2016

Structural Information and Communication Complexity

Self Cite

View full text Add to dashboard Cite

We consider communication problems in the setting of mobile agents deployed in an edge-weighted network. The assumption of the paper is that each agent has some energy that it can transfer to any other agent when they meet (together with the information it holds). The paper deals with three communication problems: data delivery, convergecast and broadcast. These problems are posed for a centralized scheduler which has full knowledge of the instance. It is already known that, without energy exchange, all three problems are NP-complete even if the network is a line. Surprisingly, if we allow the agents to exchange energy, we show that all three problems are polynomially solvable on trees and have linear time algorithms on the line. On the other hand for general undirected and directed graphs we show that these problems, even if energy exchange is allowed, are still NP-complete.

show abstract

“…In fact, substituting one for the other results in a degree 4 polynomial equation that can be solved analytically. Only one of the solutions satisfies conditions 0 ≤ β ≤ π/2 − α, which is the β = β(α) described in (11). The value of γ is calculated using (9) as γ := arccos 4 3 cos α + β .…”

mentioning

confidence: 99%

Symmetric rendezvous with advice: How to rendezvous in a disk

Georgiou

Griffiths

Yakubov

2019

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

In the classic Symmetric Rendezvous problem on a Line (SRL), two robots at known distance 2 but unknown direction execute the same randomized algorithm trying to minimize the expected rendezvous time. A long standing conjecture is that the best possible rendezvous time is 4.25 with known upper and lower bounds being very close to that value. We introduce and study a geometric variation of SRL that we call Symmetric Rendezvous in a Disk (SRD) where two robots at distance 2 have a common reference point at distance ρ. We show that even when ρ is not too small, the two robots can meet in expected time that is less than 4.25. Part of our contribution is that we demonstrate how to adjust known, even simple and provably non-optimal, algorithms for SRL, effectively improving their performance in the presence of a reference point. Special to our algorithms for SRD is that, unlike in SRL, for every fixed ρ the worst case distance traveled, i.e. energy that is used, in our algorithms is finite. In particular, we show that the energy of our algorithms is O ρ 2 , while we also explore time-energy tradeoffs, concluding that one may be efficient both with respect to time and energy, with only a minor compromise on the optimal termination time. This is the full version of the paper with the same title which will appear in the The rendezvous problem was first proposed informally by Alpern [1] in 1976, and received attention due to the seminal works of Anderson and Weber [12] for discrete domains and of Alpern [2] for continuous domains. Our work is a direct generalization of the special and so-called Symmetric Rendezvous Search Problem on a Line (SRL) proposed by Alpern [2] in 1995. In that problem, two blind agents are at known distance 2 on a line, and they can perform the same synchronized randomized algorithm (with no shared randomness). The original algorithm of Alpern [2] had performance (expected rendezvous time) 5, which was later improved to 4.5678 [13], then to 4.4182 [15], then to 4.3931 [35], and finally to the best performance known of 4.2574 [28] by Han et al. Similarly, a series of proven lower bounds [8], [35] have lead to the currently best value known of 4.1520 [28].A number of variations of SRL have been exhaustively studied, and below we mention just a few. The symmetric rendezvous problem with unknown initial distance or with partial information about it has been considered in [17] and [16]. A number of different topologies have been considered including labeled network [10], labeled line [18], ring [31], [27] (see survey monograph [30]), torus [29], planar lattice [5], and high dimensional host spaces [7]. We note here that the topology we consider in this work follows a long list studies of relevant search/rendezvous-type problems in the disk. The rendezvous problem with faulty components has been studied in [24] and [25]. Asynchronous strategies have been explored in [34] and [33]. Studied variations of robots capabilities include sense of direction [6], [14], memory [20], visibility [22], speed [26], pow...

show abstract

Collecting Information by Power-Aware Mobile Agents

Cited by 11 publications

References 45 publications

Data Delivery by Energy-Constrained Mobile Agents on a Line

Data Delivery by Energy-Constrained Mobile Agents on a Line

Communication Problems for Mobile Agents Exchanging Energy

Symmetric rendezvous with advice: How to rendezvous in a disk

Contact Info

Product

Resources

About