Pith. sign in

REVIEW

Collision Free Navigation with Interacting, Non-Communicating Obstacles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.12092 v1 pith:FYJ54UOG submitted 2020-08-27 eess.SY cs.SY

classification eess.SYcs.SY
keywords controlagentagentsalgorithmotheractioncomputedcomputes
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper we consider the problem of navigation and motion control in an area densely populated with other agents. We propose an algorithm that, without explicit communication and based on the information it has, computes the best control action for all the agents and implements its own. Notably, the host agent (the agent executing the algorithm) computes the differences between the other agents' computed and observed control actions and treats them as known disturbances that are fed back into a robust control barrier function (RCBF) based quadratic program. A feedback loop is created because the computed control action for another agent depends on the previously used disturbance estimate. In the case of two interacting agents, stability of the feedback loop is proven and a performance guarantee in terms of constraint adherence is established. This holds whether the other agent executes the same algorithm or not.

Discussion (0). Continue with ORCID to comment.

Pith tools