Pith. sign in

REVIEW 4 major objections 6 minor 57 references

Adaptive Ergodic Search with Energy-Aware Scheduling for Persistent Multi-Robot Missions

T0 review · 4 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read mEclares claims that a team of rechargeable quadrotors can keep gathering information indefinitely while sharing one mobile charger, with formal guarantees on battery floors and staggered returns that survive loss of the central…

desk verdict Real hardware and a coherent framework, but the persistence guarantee rests on an unvalidated worst-case battery model and the TISD metric is partly self-referential. read the letter →

arxiv 2505.11663 v1 pith:MDNBZJX2 submitted 2025-05-16 cs.RO

Kaleb Ben Naveed , Devansh R. Agrawal , Rahul Kumar , Dimitra Panagou This is my paper · ORCID
classification cs.RO
keywords informativepathplanningergodicsearchclarityenergy-awareschedulingmulti-robotcoordinationpersistentmissionsmobilechargingstationstochasticspatiotemporalenvironments
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper argues that a team of rechargeable robots exploring an environment whose information content decays unpredictably can keep operating forever with a single mobile charging station, and that the guarantees hold in practice, not just in simulation. For exploration, it builds the target density that ergodic search must match out of clarity, a bounded information measure whose decay rate is set by the environment's own process noise, so regions that are losing information fastest attract the most sensing effort. For persistence, it contributes RmeSch, an online scheduler in which each robot proposes a trajectory that follows a slice of its exploration plan and then returns to the charger's predicted position, and only proposals that keep a battery reserve and a minimum gap between charging visits are committed. The paper's Theorem 1 states that, if the fleet is no larger than a bound derived from the least-charged robot's flight time, the battery-floor and exclusive-access constraints hold for all future time, and a fail-safe protocol preserves them even if the coordinating central node fails. If these claims hold, long-term environmental monitoring no longer needs preplanned schedules, static or dedicated charging stations, or a continuously reliable central computer.

What carries the argument

The load-bearing object is the clarity metric $q = 1/(1+P)$ with multi-robot dynamics $\dot{q} = (1-q)^2 \sum_{i\in R} C(x_i)^2/R(x_i) - Qq^2$ (Eq. 17), a bounded $[0,1]$ information measure whose closed-form trajectory (Eq. 18) yields the time-to-target function $\Delta T(q_0, q_1)$ (Eq. 19). genTISD turns this function into the ergodic target distribution, so the planner's priorities come from the environment model instead of a hand-tuned density. On the scheduling side, the carrying mechanism is the sorted list of remaining flight times feeding gap flags $G_l = T_F^l > T_R + T_E + lT_\delta$, the reserve energy computed from an EKF prediction of the charger's 95% confidence ellipse, and the gware/eware commit checks; these produce the fleet-size bound in Lemma 1 and the inductive feasibility argument of Theorem 1. The fail-safe machinery is a stored return index per robot, which converts a dead central node into a deterministic staggered return.

What would settle it

Run RmeSch with a battery that drains faster than the modeled worst case in any interval (for instance, $\dot{e} = -0.9$ where the model says $-0.667$) and record state of charge at landing; if the minimum-SoC constraint (23a) is violated before touchdown, or if a scripted central-node dropout ever brings two robots to the charger less than $T_\delta$ apart, then the feasibility guarantee as stated fails.

Watch

Extended reading notes

Core claim

The paper's central claim is that persistent multi-robot information gathering in stochastic spatiotemporal environments reduces to two constructions that plug together. The first sets the ergodic target density at each cell proportional to the time needed to raise that cell's clarity from its current value to the desired target, normalized over the domain (genTISD); since clarity obeys $\dot{q} = (1-q)^2 \sum_{i\in R} C(x_i)^2/R(x_i) - Qq^2$ and admits a closed-form inversion $\Delta T(q_0, q_1)$, the target density concentrates automatically where information decays fastest or the desired quality is highest. The second lets every robot head for the predicted position of a single mobile charging station, holding in reserve the energy required to reach the worst point inside the 95% confidence ellipse of that prediction, and commits trajectories only when the gap flag $T_F^l > T_R + T_E + lT_\delta$ and the reserve state-of-charge check both pass. Theorem 1 asserts that with at most $N^* = 1 + \lfloor (T_{F,0}^{1'} - T_R - T_E)/T_\delta \rfloor$ robots and valid initial checks, the minimum-energy and minimum-gap constraints hold for all time, and that if the central node dies, rank-based idle times followed by replay of the last committed trajectory preserve both constraints. The paper presents multi-quadrotor hardware experiments with a ground-based charging rover as evidence that the pipeline runs in real time.

Load-bearing premise

The energy-feasibility guarantee rests entirely on the worst-case battery discharge model $f_i^e(e_i)$ in Eq. (1) really being an upper bound on how fast each battery can drain, and the experiments use a constant rate $\dot{e} = -0.667$ with no uncertainty margin, so a real battery that drains faster than modeled could hit the minimum state of charge before it reaches the charger.

Editorial extensions

If this is right

  • Persistence without preplanning: under Theorem 1, any committed trajectory is energy-feasible and charger-conflict-free for all time, as long as the fleet respects the Lemma 1 size bound.
  • Ergodic search gains a model-derived target density: with process noise $Q_p$ known per cell, clarity-based genTISD replaces uniform or hand-tuned densities and, per the paper's Section 4.1 argument, drives down the mean clarity deficit as a direct effect of ergodicity.
  • No static charging infrastructure: the mobile charger follows the geometric center of the team's nominal trajectories, and RmeSch runs as a planner-agnostic module that the paper demonstrates with both ergodic and non-ergodic (Lissajous) coverage planners.
  • Central node failure is survivable: each robot needs only its latest committed trajectory and its return index, so exclusive charging access and the battery floor survive communication loss beyond the decision interval.
  • Fleet size can change online: new robots can be added whenever the least-charged robot's flight time satisfies the Remark 2 condition, and failed robots can be dropped from gap-flag checks without breaking the guarantees for the rest.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The claim that ergodic search with the clarity-derived TISD 'naturally minimizes' the mean clarity deficit is argued by motivation (Section 4.1) rather than proven; if a formal equivalence were established, the same $\varphi_p = \Delta T(q_p, q_p^*)$ construction would transfer directly to any scalar field with known stochasticity, such as ocean or atmospheric variables.
  • The constant worst-case discharge rate used in experiments ($\dot{e} = -0.667$ with no uncertainty margin) is the weakest seal in the guarantee chain; validating the scheduler with an online, conservative discharge bound under wind or payload variation would turn the energy-feasibility theorem from conditional into demonstrated.
  • Because the fail-safe protocol only requires a rank and a stored trajectory, the same scheduling logic ports to fully decentralized or intermittently connected networks with little change, although the paper lists that direction as future work.
  • The charging gap $T_\delta$ acts as a scheduling quantum: Lemma 1 sets the maximum team size roughly as $1/T_\delta$, so a mission needing more robots must shorten charging-plus-buffer time or accept a smaller fleet; the paper does not discuss this trade as a design parameter.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes mEclares, a framework for persistent multi-robot exploration in stochastic spatiotemporal environments, combining a clarity-based target information spatial distribution (genTISD) with ergodic trajectory optimization and an energy-aware scheduler (RmeSch) for a team of rechargeable robots sharing a single mobile charging rover. The authors derive multi-agent clarity dynamics, construct a TISD from the time required to raise each cell's clarity to a target value, and generate candidate trajectories that track a portion of the ergodic plan before returning to a rendezvous point. RmeSch commits or rejects these candidates through gap-aware (gware) and energy-aware (eware) checks, and a fail-safe maneuver is specified for central-node failure. The paper claims feasibility guarantees for the minimum state-of-charge and return-gap constraints, and validates the approach in simulation and on quadrotor hardware with a mobile charging rover; code and an experiment video are released.

Significance. If established, the framework would be a practically useful integration: it supports general nonlinear robot dynamics, a shared mobile charger, online replanning without preplanned schedules, and fail-safe operation under central-node failure, with real hardware experiments and released code. The modular separation between a clarity-driven ergodic planner and an energy scheduler is attractive, and the open-source implementation is a strength. However, the manuscript currently does not establish the claimed link between TISD matching and clarity-deficit minimization, the energy-feasibility guarantee depends on an unvalidated worst-case discharge model, and the reserve-energy formula in Eq. (31a) has a sign error that, as written, makes the energy check vacuous. These are significant but fixable issues, so the appropriate outcome is major revision rather than rejection.

major comments (4)
  1. [Section 7.2.2, Eq. (31a); Section 7.2.6, Eq. (38)] The reserve energy is defined as e_i,res_j = e_i(t_i^f) - e_i(t_i^0), where t_i^0 and t_i^f are the initial and final times of the landing maneuver from the rendezvous point to the worst-case charging position. For any discharging battery, including the constant ˙e = -0.667 used in Sections 8.1 and 8.3, this quantity is negative. The Reserve SoC Condition (38), e_i(t) > e_i,res_j for all t in [t_j, t_i_{j,C}], is then satisfied trivially by every nonnegative trajectory, so eware (Algorithm 4) cannot reject any candidate. The quantity that must appear in (38) is the energy cost of the landing maneuver, e_i(t_i^0) - e_i(t_i^f), which is positive. Because Theorem 1's minimum-energy guarantee relies on (38), and Table 2 distinguishes Baselines 4 and 5 by the action of eware, this sign error is load-bearing. Please correct the sign and re-run or re-verify the affected simulation and hardware claims.
  2. [Section 7.3, Theorem 1; Eq. (1); Eq. (29)] The feasibility guarantee is stated as holding 'for all t' and for all robots, but its energy part rests on f_i^e being a worst-case model of battery discharge, and this property is never established. Eq. (1) labels f_i^e 'worst-case battery discharge dynamics,' yet no uncertainty set, no conservatism argument, and no validation protocol are given. The reserve energy in (31), computed via the 95% confidence ellipse in (29), covers only position uncertainty of the mobile charger, not discharge-rate uncertainty. The experiments use the constant ˙e = -0.667 without error bars (Sections 8.1 and 8.3), and the 30-robot scalability result reports returns at (3 ± 1)% SoC, leaving almost no margin. If the true discharge rate is higher than modeled, a robot can cross e_min before reaching the charger, contradicting (23a). Please either provide a calibrated upper bound on discharge with an uncertainty model and feed it into the reserve computation, or explicitly state the guarantee as conditional on the model being an upper bound and add a safety margin in experiments.
  3. [Section 4.1; Algorithm 1; Section 8.2] The claim that ergodic search with a clarity-based TISD 'naturally minimizes the mean clarity deficit (21)' is not established. Problem (5) minimizes the Sobolev norm between the time-averaged visitation distribution and φ, whereas (24a) minimizes the rectified terminal clarity deficit; these are different objectives. genTISD sets φ_p proportional to ΔT(q_p(t_k), \bar q_p) and normalizes (Algorithm 1, lines 5-8), which is a heuristic allocation of sensing time, and the nonlinear clarity dynamics (17) mean that proportional time allocation does not generally equalize terminal deficits. The evaluation in Section 8.2 then uses the same mean clarity deficit (21) that defines the TISD, so the comparison partially measures self-consistency rather than an externally grounded information objective. Please provide a formal statement with assumptions under which matching φ minimizes (21), or present genTISD as a heuristic and include a clarity-aware baseline not derived from (21).
  4. [Appendix A.2, proof of Theorem 1] The induction proof mostly restates the acceptance checks of gware and eware instead of proving the claimed implications. The arrow from the gap-flag inequalities (35) to |t^{i1}_{m1} - t^{i2}_{m2}| > Tδ on [t_j, t_{j,R}) is asserted without an explicit mapping from remaining flight times to actual return times under the candidate and committed trajectories. In the central-node-failure case, the statement that a robot retains enough energy because its previously committed trajectory was feasible does not account for the energy consumed during the idle interval (ret_i - 1)Tδ in Algorithm 5, nor for the time shift in (40); the original trajectory was feasible from t_{j-1}, not from t_j plus an idle delay. Please provide a complete induction with explicit return-time schedules and energy integrals over the full horizon, or state a weaker theorem that matches what is actually proven.
minor comments (6)
  1. [Algorithm 2, line 3] The 'return RmeSch(...)' branch is a recursive call rather than a blocking wait; when messages are missing this is either an infinite loop or undefined behavior. Rewrite as an explicit wait-and-retry procedure with a timeout.
  2. [Algorithm 2, line 8; Algorithm 5] The symbol 'li' is not defined, and the fail-safe logic uses ret_i^j inconsistently across Algorithm 2 and Algorithm 5. Please define all return indices and make the notation uniform.
  3. [Throughout] The method name is spelled RmeSch, meSch, and Rmesch at different points (Abstract, Sections 4.2, 7.2, 8.3, Table 2). Standardize the name throughout the manuscript.
  4. [Section 3.2, Eq. (20b)] R(X) is used as a scalar measurement-noise variance for a single cell, but R(X) is defined in (14) as an N by N matrix. Use a cell-specific scalar, for example R_p(x_i), to avoid an ill-typed expression.
  5. [Sections 8.1 and 8.3.1] The text states that the minimum energy requirement is zero in the hardware experiments, while the 30-robot simulation returns at (3 ± 1)% SoC. Please clarify the relationship between e_min, the reserve energy e_i,res, and the reported margins.
  6. [Algorithm 3, line 4; Eq. (27)] The pseudocode writes G_l as (T_l^F - T_R - T_E) > l(Tδ), while Eq. (27) writes G_l = T_l^F > (T_R + T_E + lTδ). They are algebraically equivalent, but presenting the same condition in different forms is confusing; use one form consistently.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: clarity-based TISD construction and RmeSch feasibility checks are explicit design choices rather than self-referential reductions.

full rationale

The paper contains no load-bearing circular step. The clarity dynamics in Eqs. (15)-(17) are re-derived from the Kalman filter equations in Section 3.1 rather than imported by citation, so the citation to Agrawal and Panagou (2023) is background context, not a circularity carrier. genTISD (Algorithm 1) defines each TISD value phi_p as the normalized time-to-target DeltaT(q_p, qbar_p) from Eq. (19); this is a direct design objective, and evaluating the planner with the mean clarity deficit of Eq. (21) is ordinary objective alignment rather than a hidden fit, especially because the lawnmower and uniform-TISD baselines are scored on the same metric without access to genTISD's construction. The RmeSch guarantees in Theorem 1 and Appendix A.2 are conditional certificates: they assume the Gap flag condition (35) and the Reserve SoC condition (38) are satisfied, and then prove that these sufficient conditions imply the minimum-energy constraint (23a) and return-gap constraint (23b) by induction. The checks are constructed for that implication, not conclusions smuggled into the premises. No fitted parameter is renamed as a prediction, no uniqueness theorem is imported from the authors' prior work, and no equation is asserted both as input and output. The main caveat is not circularity: Eq. (1) labels f_i^e as worst-case battery discharge dynamics, but the experiments and simulations use a constant e_dot = -0.667 with no uncertainty bound, so the premise of Theorem 1 is an unvalidated assumption. That is a soundness concern, not a circular-derivation concern.

Assumptions & free parameters 8 free parameters · 9 assumptions · 0 invented entities

The central claims rest mainly on prior-work information metrics, on an independent-cell environment model, and on several existence and worst-case assumptions that the paper states but does not verify. The only ad hoc constructions are the Delta-T-based target density and the 95% confidence reserve energy. No new physical entities are introduced.

free parameters (8)
  • Planning horizon T_H = 30.0 s (simulation and hardware)
    User-defined; must exceed T_N and T_R per Assumption 1; sets the replanning cadence for ergodic trajectories.
  • Scheduling interval T_E = 1.5 s in hardware
    User-defined RmeSch decision interval; the hardware latency experiment requires T1 + T2 + T3 < T_E.
  • Nominal horizon T_N and return time T_R = T_N = 2.0 s, T_R = 18.0 s
    User-defined; Assumption 1 requires these be known for the scheduler; they set the structure of candidate trajectories.
  • Charging duration T_ch and buffer T_bf = T_ch = 0.0 s, T_bf = 15.0 s in all experiments
    User-defined; defines the minimum gap T_delta between charging sessions.
  • Target clarity q_p per cell = environment-specific
    Chosen per environment in genTISD; the whole TISD and the clarity deficit metric depend on it.
  • Rendezvous height d above the charger = not specified
    User-defined constant in Eq. (28); affects reserve energy and landing feasibility.
  • Battery discharge rate in experiments = e_dot = -0.667
    Constant discharge model used in simulations and hardware; the scheduler's energy predictions depend on this model being worst-case.
  • Epsilon in Algorithm 1 = not specified
    Small constant to keep target clarity below the attainable maximum q_infinity; its value is not given.
assumptions (9)
  • domain assumption Clarity as a bounded measure with dynamics Eq. (9)
    Adopted from Agrawal and Panagou (2023); the TISD construction and the clarity deficit metric both rest on this prior model.
  • domain assumption Per-cell independent random walk Eq. (20a)
    Each cell's information evolves independently with known process noise; spatial correlation is neglected.
  • domain assumption Known measurement noise and independent stacked measurements Eqs. (12)-(14)
    Multi-robot clarity dynamics (17) rely on stacked independent measurements with known variances R(x_i).
  • domain assumption Existence of solutions to optimal control problems (30) and (32)
    Theorem 1 explicitly assumes existence; for general nonlinear dynamics with tight energy margins this is not guaranteed.
  • domain assumption Existence of a landing controller (Assumption 2)
    The scheduler assumes returning robots can land on the mobile charger after reaching the rendezvous point; no controller is constructed or verified.
  • domain assumption Known worst-case battery discharge model f_i^e
    Energy feasibility and remaining flight time are predicted from this model; if the true discharge is faster, constraint (23a) can fail.
  • domain assumption Mobile charging robot never needs recharging
    Stated in Section 3.3 footnote b; the method does not schedule energy for the charging rover.
  • ad hoc to paper Normalized Delta-T target density (Algorithm 1)
    The TISD is set to the normalized time needed to raise clarity to target; this is a heuristic choice without an optimality proof.
  • ad hoc to paper Reserve energy from 95% confidence ellipse Eq. (29)
    Only the worst point on the 95% covariance ellipse is covered; the remaining 5% risk is not formally handled.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Adaptive Ergodic Search with Energy-Aware Scheduling for Persistent Multi-Robot Missions." pith.science (2026). https://pith.science/paper/MDNBZJX2

@misc{pith2026250511663,
  author       = {Pith},
  title        = {Pith review of: Adaptive Ergodic Search with Energy-Aware Scheduling for Persistent Multi-Robot Missions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MDNBZJX2}},
  note         = {Machine review of arXiv:2505.11663}
}
read the original abstract

Autonomous robots are increasingly deployed for long-term information-gathering tasks, which pose two key challenges: planning informative trajectories in environments that evolve across space and time, and ensuring persistent operation under energy constraints. This paper presents a unified framework, mEclares, that addresses both challenges through adaptive ergodic search and energy-aware scheduling in multi-robot systems. Our contributions are two-fold: (1) we model real-world variability using stochastic spatiotemporal environments, where the underlying information evolves unpredictably due to process uncertainty. To guide exploration, we construct a target information spatial distribution (TISD) based on clarity, a metric that captures the decay of information in the absence of observations and highlights regions of high uncertainty; and (2) we introduce Robustmesch (Rmesch), an online scheduling method that enables persistent operation by coordinating rechargeable robots sharing a single mobile charging station. Unlike prior work, our approach avoids reliance on preplanned schedules, static or dedicated charging stations, and simplified robot dynamics. Instead, the scheduler supports general nonlinear models, accounts for uncertainty in the estimated position of the charging station, and handles central node failures. The proposed framework is validated through real-world hardware experiments, and feasibility guarantees are provided under specific assumptions.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

57 extracted references · 29 canonical work pages

  1. [1]

    write newline

    " write newline " cite write " FUNCTION editor.postfix editor num.names #1 > "( )" "( )" if FUNCTION editor.trans.postfix editor num.names #1 > "( )" "( )" if FUNCTION trans.postfix translator num.names #1 > "( )" "( )" if FUNCTION authors.editors.reflist.apa5 'field := 'dot := field num.names 'numnames := numnames 'format.num.names := format.num.names na...

  2. [2]

    sn-aps.bst

    FUNCTION identify.aps.version "sn-aps.bst" " [2024/07/19 v1.1 APS bibliography style]" * top ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year eprint archive archivePrefix primaryClass adsurl adsnote version lab...

    2024

  3. [3]

    write newline

    " write newline "" before.all 'output.state := FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap duplicate "7" = swap duplicate "8" = swap "9" = or or or or or or or or or FUNCTION n.separate 't := "" #0 'numnames := t empty not t #-1 #1 subs...

  4. [4]

    sn-basic.bst

    FUNCTION identify.basic.version "sn-basic.bst" " [2024/07/19 v1.1 bibliography style]" * top ENTRY address archive author booktitle chapter doi edition editor eid eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year archivePrefix primaryClass adsurl adsnote version lab...

    2024

  5. [5]

    write newline

    " write newline "" before.all 'output.state := FUNCTION add.period duplicate empty 'skip "." * add.blank if FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap duplicate "7" = swap duplicate "8" = swap "9" = or or or or or or or or or FUNCTION ...

  6. [6]

    write newline

    " write newline "" before.all 'output.state := FUNCTION output.doi doi empty skip "doi:" doi * "" * output if FUNCTION format.archive archivePrefix empty "" archivePrefix ":" * if FUNCTION format.primaryClass primaryClass empty "" " [" primaryClass * "] " * if FUNCTION format.eprint eprint empty "" archive empty " https://arxiv.org/abs/" eprint * " " * " ...

  7. [7]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTION find.integer 't := #0 'int := int not t empty not and t #1 #1 substring 's :=...

  8. [8]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTION find.integer 't := #0 'int := int not t empty not and t #1 #1 substring 's :=...

Show all 57 references
  1. [9]

    sn-nature.bst

    FUNCTION identify.nature.version "sn-nature.bst" " [2024/07/19 v1.1 bibliography style]" * top ENTRY address archive author booktitle chapter edition editor eprint howpublished institution journal key keywords month note number organization pages publisher school series title ...

    2024

  2. [10]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  3. [11]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  4. [12]

    sn-vancouver-num.bst

    FUNCTION identify.vancouver.version "sn-vancouver-num.bst" " [2024/07/19 v1.1 Vancouver bibliography style]" * top ENTRY address assignee author booktitle chapter cartographer day edition editor howpublished institution inventor journal key keywords month note number organizat...

    2024

  5. [13]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  6. [14]

    , Prabhakar, A

    abraham2021ergodic APACrefauthors Abraham, I. , Prabhakar, A. \ Murphey, T D. APACrefauthors \ 2021 . An ergodic measure for active learning from equilibrium An ergodic measure for active learning from equilibrium . IEEE Transactions on Automation Science and Engineering 18 3 917--931

    2021

  7. [15]

    , Chen, R

    gatekeeper APACrefauthors Agrawal, D. , Chen, R. \ Panagou, D. APACrefauthors \ 2023 . gatekeeper: Online safety verification and control for nonlinear systems in dynamic environments gatekeeper: Online safety verification and control for nonlinear systems in dynamic environme...

    2023

  8. [16]

    \ Panagou, D

    clarity APACrefauthors Agrawal, D R. \ Panagou, D. APACrefauthors \ 2023 . Sensor-Based Planning and Control for Robotic Systems: Introducing Clarity and Perceivability Sensor-based planning and control for robotic systems: Introducing clarity and perceivability . IEEE Control...

    2023

  9. [17]

    CBF_TAC APACrefauthors Ames, A D. , Xu, X. , Grizzle, J W. \ Tabuada, P. APACrefauthors \ 2017 . Control Barrier Function Based Quadratic Programs for Safety Critical Systems Control barrier function based quadratic programs for safety critical systems . IEEE Trans. on Automat...

    2017

  10. [18]

    , Sundaram, S

    singall_for_all_1 APACrefauthors Asghar, A B. , Sundaram, S. \ Smith, S L. APACrefauthors \ 2023 . Multi-Robot Persistent Monitoring: Minimizing Latency and Number of Robots with Recharging Constraints. Multi-robot persistent monitoring: Minimizing latency and number of robots...

    2023

  11. [19]

    , Hoang, T

    bentz2018complete APACrefauthors Bentz, W. , Hoang, T. , Bayasgalan, E. \ Panagou, D. APACrefauthors \ 2018 . Complete 3-D dynamic coverage in energy-constrained multi-UAV sensor networks Complete 3-d dynamic coverage in energy-constrained multi-uav sensor networks . Autonomou...

    2018

  12. [20]

    , Bicego, M

    bottarelli2019orienteering APACrefauthors Bottarelli, L. , Bicego, M. , Blum, J. \ Farinelli, A. APACrefauthors \ 2019 . Orienteering-based informative path planning for environmental monitoring Orienteering-based informative path planning for environmental monitoring . Engine...

    2019

  13. [21]

    , Khardon, R

    Chen-RSS-22 APACrefauthors Chen, W. , Khardon, R. \ Liu, L. APACrefauthors \ 2022 June . AK: Attentive Kernel for Information Gathering AK: Attentive Kernel for Information Gathering . Proceedings of Robotics: Science and Systems. Proceedings of robotics: Science and systems. ...

    2022 doi

  14. [22]

    \ Pignon, P

    choset1998coverage APACrefauthors Choset, H. \ Pignon, P. APACrefauthors \ 1998 . Coverage path planning: The boustrophedon cellular decomposition Coverage path planning: The boustrophedon cellular decomposition . Field and service robotics Field and service robotics \ ( \ 203--209)

    1998

  15. [23]

    , Abraham, I

    cmu_ergodic APACrefauthors Coffin, H. , Abraham, I. , Sartoretti, G. , Dillstrom, T. \ Choset, H. APACrefauthors \ 2022 . Multi-agent dynamic ergodic search with low-information sensors Multi-agent dynamic ergodic search with low-information sensors . 2022 International Confer...

    2022

  16. [24]

    \ Vaughan, R T

    cooperative_2 APACrefauthors Couture-Beil, A. \ Vaughan, R T. APACrefauthors \ 2009 . Adaptive mobile charging stations for multi-robot systems Adaptive mobile charging stations for multi-robot systems . 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems ...

    2009

  17. [25]

    , Berger, H

    dong2023time APACrefauthors Dong, D. , Berger, H. \ Abraham, I. APACrefauthors \ 2023 . Time Optimal Ergodic Search Time optimal ergodic search . arXiv preprint arXiv:2305.11643

    2023 arXiv

  18. [26]

    \ Kochenderfer, M J

    Dressel_Ergodic APACrefauthors Dressel, L. \ Kochenderfer, M J. APACrefauthors \ 2019 . Tutorial on the generation of ergodic trajectories with projection-based gradient descent Tutorial on the generation of ergodic trajectories with projection-based gradient descent . IET Cyp...

    2019

  19. [27]

    \ Beltrame, G

    persis_Fouad APACrefauthors Fouad, H. \ Beltrame, G. APACrefauthors \ 2022 . Energy Autonomy for Robot Systems With Constrained Resources Energy autonomy for robot systems with constrained resources . IEEE Transactions on Robotics 38 6 3675--3693 . APACrefDOI doi:10.1109/TRO.2...

    2022

  20. [28]

    \ Bhattacharya, S

    multirobot_game_theoretic APACrefauthors Gao, T. \ Bhattacharya, S. APACrefauthors \ 2019 . Multirobot Charging Strategies: A Game-Theoretic Approach Multirobot charging strategies: A game-theoretic approach . IEEE Robotics and Automation Letters 4 3 2823--2830 . APACrefDOI do...

    2019

  21. [29]

    APACrefauthors \ 2021

    Candela_thesis APACrefauthors Garza, A C. APACrefauthors \ 2021 . \ Bayesian Models for Science-Driven Robotic Exploration Bayesian models for science-driven robotic exploration \ . \ Pittsburgh, PA Carnegie Mellon University

    2021

  22. [30]

    , Todd, R E

    gulf1 APACrefauthors Gawarkiewicz, G. , Todd, R E. , Zhang, W. , Partida, J. , Gangopadhyay, A. , Monim, M U H. Dent, M. APACrefauthors \ 2018 . The changing nature of shelf-break exchange revealed by the OOI Pioneer Array The changing nature of shelf-break exchange revealed b...

    2018

  23. [31]

    applied_optimal_estimation APACrefauthors Gelb, A. \ . APACrefauthors \ 1974 . Applied optimal estimation Applied optimal estimation . MIT press

    1974

  24. [32]

    , Tracy, K

    jackson2021planning APACrefauthors Jackson, B E. , Tracy, K. \ Manchester, Z. APACrefauthors \ 2021 . Planning with attitude Planning with attitude . IEEE Robotics and Automation Letters 6 3 5658--5664

    2021

  25. [33]

    \ Kochenderfer, M J

    julian2019distributed APACrefauthors Julian, K D. \ Kochenderfer, M J. APACrefauthors \ 2019 . Distributed wildfire surveillance with autonomous aircraft using deep reinforcement learning Distributed wildfire surveillance with autonomous aircraft using deep reinforcement learn...

    2019

  26. [34]

    , Asghar, A B

    pre-plan_1 APACrefauthors Karapetyan, N. , Asghar, A B. , Bhaskar, A. , Shi, G. , Manocha, D. \ Tokekar, P. APACrefauthors \ 2023 . AG-CVG: Coverage Planning with a Mobile Recharging UGV and an Energy-Constrained UAV. Ag-cvg: Coverage planning with a mobile recharging ugv and ...

    2023

  27. [35]

    , Bychkov, I

    periodic_charging APACrefauthors Kenzin, M. , Bychkov, I. \ Maksimkin, N. APACrefauthors \ 2020 . Coordinated Recharging of Heterogeneous Mobile Robot Teams during Continuous Large Scale Missions Coordinated recharging of heterogeneous mobile robot teams during continuous larg...

    2020

  28. [36]

    , Liu, Y C

    pre-plan_2 APACrefauthors Kingry, N. , Liu, Y C. , Martinez, M. , Simon, B. , Bang, Y. \ Dai, R. APACrefauthors \ 2017 . Mission planning for a multi-robot team with a solar-powered charging station Mission planning for a multi-robot team with a solar-powered charging station ...

    2017

  29. [37]

    , Patankar, S

    static_placing_charging APACrefauthors Li, B. , Patankar, S. , Moridian, B. \ Mahmoudian, N. APACrefauthors \ 2018 . Planning Large-Scale Search and Rescue using Team of UAVs and Charging Stations Planning large-scale search and rescue using team of uavs and charging stations ...

    2018

  30. [38]

    , Yel, E

    continous_comms_1 APACrefauthors Lin, T X. , Yel, E. \ Bezzo, N. APACrefauthors \ 2018 . Energy-aware Persistent Control of Heterogeneous Robotic Systems Energy-aware persistent control of heterogeneous robotic systems . 2018 Annual American Control Conference (ACC) 2018 annua...

    2018

  31. [39]

    , Yazıcıoğlu, Y

    MOBILE_RAL_2022 APACrefauthors Lin, X. , Yazıcıoğlu, Y. \ Aksaray, D. APACrefauthors \ 2022 . Robust Planning for Persistent Surveillance With Energy-Constrained UAVs and Mobile Charging Stations Robust planning for persistent surveillance with energy-constrained uavs and mobi...

    2022

  32. [40]

    \ Michael, N

    static_charging_bipartite APACrefauthors Liu, L. \ Michael, N. APACrefauthors \ 2014 . Energy-aware aerial vehicle deployment via bipartite graph matching Energy-aware aerial vehicle deployment via bipartite graph matching . 2014 International Conference on Unmanned Aircraft S...

    2014

  33. [41]

    , Li, A Q

    water_exploration2 APACrefauthors Manjanna, S. , Li, A Q. , Smith, R N. , Rekleitis, I. \ Dudek, G. APACrefauthors \ 2018 . Heterogeneous multi-robot system for exploration and strategic water sampling Heterogeneous multi-robot system for exploration and strategic water sampli...

    2018

  34. [42]

    \ Mezić, I

    Mezic_Ergodic APACrefauthors Mathew, G. \ Mezić, I. APACrefauthors \ 2011 . Metrics for ergodicity and design of ergodic dynamics for multi-agent systems Metrics for ergodicity and design of ergodic dynamics for multi-agent systems . Physica D: Nonlinear Phenomena 240 4 432--4...

    2011 doi

  35. [43]

    , Smith, S L

    cooperative_1 APACrefauthors Mathew, N. , Smith, S L. \ Waslander, S L. APACrefauthors \ 2015 . Multirobot Rendezvous Planning for Recharging in Persistent Tasks Multirobot rendezvous planning for recharging in persistent tasks . IEEE Transactions on Robotics 31 1 128--142 . A...

    2015

  36. [44]

    , Lischke, L

    search_rescue1 APACrefauthors Mayer, S. , Lischke, L. \ Wo \'z niak, P W. APACrefauthors \ 2019 . Drones for search and rescue Drones for search and rescue . 1st International Workshop on Human-Drone Interaction. 1st international workshop on human-drone interaction

    2019

  37. [45]

    , Krause, A

    meliou2007nonmyopic APACrefauthors Meliou, A. , Krause, A. , Guestrin, C. \ Hellerstein, J M. APACrefauthors \ 2007 . Nonmyopic informative path planning in spatio-temporal models Nonmyopic informative path planning in spatio-temporal models . AAAI Aaai \ ( 10, \ 16--7)

    2007

  38. [46]

    , Suvarna, N

    moon2025ia APACrefauthors Moon, B. , Suvarna, N. , Jong, A. , Chatterjee, S. , Yuan, J. \ Scherer, S. APACrefauthors \ 2025 . IA-TIGRIS: An Incremental and Adaptive Sampling-Based Planner for Online Informative Path Planning Ia-tigris: An incremental and adaptive sampling-base...

    2025

  39. [47]

    , Agrawal, D

    naveed2024eclares APACrefauthors Naveed, K B. , Agrawal, D. , Vermillion, C. \ Panagou, D. APACrefauthors \ 2024 1 . Eclares: Energy-aware clarity-driven ergodic search Eclares: Energy-aware clarity-driven ergodic search . 2024 IEEE International Conference on Robotics and Aut...

    2024

  40. [48]

    , Agrawal, D

    naveed2023eclares APACrefauthors Naveed, K B. , Agrawal, D. , Vermillion, C. \ Panagou, D. APACrefauthors \ 2024 2 . Eclares: Energy-Aware Clarity-Driven Ergodic Search Eclares: Energy-aware clarity-driven ergodic search . 2024 IEEE International Conference on Robotics and Aut...

    2024

  41. [49]

    , Dang, A

    naveed2024mesch APACrefauthors Naveed, K B. , Dang, A. , Kumar, R. \ Panagou, D. APACrefauthors \ 2024 . meSch: Multi-Agent Energy-Aware Scheduling for Task Persistence mesch: Multi-agent energy-aware scheduling for task persistence . arXiv preprint arXiv:2406.04560

    2024 arXiv

  42. [50]

    APACrefauthors \ 2022

    dedicated_01 APACrefauthors Notomista, G. APACrefauthors \ 2022 . Resilience and Energy-Awareness in Constraint-Driven-Controlled Multi-Robot Systems Resilience and energy-awareness in constraint-driven-controlled multi-robot systems . 2022 American Control Conference (ACC) 20...

    2022

  43. [51]

    , Pacchierotti, C

    dedicated_02 APACrefauthors Notomista, G. , Pacchierotti, C. \ Giordano, P R. APACrefauthors \ 2022 . Multi-Robot Persistent Environmental Monitoring Based on Constraint-Driven Execution of Learned Robot Tasks Multi-robot persistent environmental monitoring based on constraint...

    2022

  44. [52]

    , Ruf, S F

    dedicated_03 APACrefauthors Notomista, G. , Ruf, S F. \ Egerstedt, M. APACrefauthors \ 2018 . Persistification of Robotic Tasks Using Control Barrier Functions Persistification of robotic tasks using control barrier functions . IEEE Robotics and Automation Letters 3 2 758--763...

    2018

  45. [54]

    , Lerch, C J

    seewald2024energyaware APACrefauthors Seewald, A. , Lerch, C J. , Chancán, M. , Dollar, A M. \ Abraham, I. APACrefauthors \ 2024 . Energy-Aware Ergodic Search: Continuous Exploration for Multi-Agent Systems with Battery Constraints. Energy-aware ergodic search: Continuous expl...

    2024

  46. [55]

    , Sousa, J

    water_exploration1 APACrefauthors Sujit, P. , Sousa, J. \ Pereira, F L. APACrefauthors \ 2009 . UAV and AUVs coordination for ocean exploration Uav and auvs coordination for ocean exploration . Oceans 2009-Europe Oceans 2009-europe \ ( \ 1--7)

    2009

  47. [56]

    , Sood, N

    sun2017no APACrefauthors Sun, W. , Sood, N. , Dey, D. , Ranade, G. , Prakash, S. \ Kapoor, A. APACrefauthors \ 2017 . No-regret replanning under uncertainty No-regret replanning under uncertainty . 2017 IEEE International Conference on Robotics and Automation (ICRA) 2017 ieee ...

    2017

  48. [57]

    APACrefauthors \ 2020

    gulf2 APACrefauthors Todd, R E. APACrefauthors \ 2020 . Export of Middle Atlantic Bight shelf waters near Cape Hatteras from two years of underwater glider observations Export of middle atlantic bight shelf waters near cape hatteras from two years of underwater glider observat...

    2020

  49. [58]

    \ Trigoni, N

    search_rescue2 APACrefauthors Waharte, S. \ Trigoni, N. APACrefauthors \ 2010 . Supporting search and rescue operations with UAVs Supporting search and rescue operations with uavs . 2010 international conference on emerging security technologies 2010 international conference o...

    2010

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.