Browse State-of-the-Art › Collision Avoidance
Collision Avoidance
122 papers with code · 1 benchmark · 2 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| A Ball Collision Dataset (ABCD) (1 row) | Eva-EVS | Towards Low-Latency Event-based Obstacle Avoidance on a FPGA-Drone | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 569 · with a code link: 122 · where Syntology ran a sample: 16 (14 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (16 of 569 tagged: 14 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)
Page 1 of 6: papers 1 to 100 of 569, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
3 Feb 2017 9 repositories listedDeep neural networks have emerged as a widely used and effective means for tackling complex, real-world problems.
-
29 Mar 2018 8 repositories listed Syntology official (archive's flag): 6 ran · 10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified (of 10 harvested samples) · 4 pointer-only (licence)Understanding human motion behavior is critical for autonomous moving platforms (like self-driving cars and social robots) if they are to navigate human-centric environments.
-
4 May 2018 6 repositories listed Syntology community repositories only · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 6 harvested samples)This work extends our previous approach to develop an algorithm that learns collision avoidance among a variety of types of dynamic agents without assuming they follow any particular behavior rules.
-
28 Apr 2018 4 repositories listed Syntology 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified (of 15 harvested samples)In this paper, we present a new direction for formally checking security properties of DNNs without using SMT solvers.
-
24 Oct 2019 3 repositories listedCollision avoidance algorithms are essential for safe and efficient robot operation among pedestrians.
-
20 Jul 2023 2 repositories listedEvent-based cameras are popular for tracking fast-moving objects due to their high temporal resolution, low latency, and high dynamic range.
-
3 Nov 2022 2 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)We consider the problem of multi-agent navigation and collision avoidance when observations are limited to the local neighborhood of each agent.
-
14 Apr 2022 2 repositories listedThe increasing prevalence of neural networks (NNs) in safety-critical applications calls for methods to certify their behavior and guarantee safety.
-
31 Aug 2021 2 repositories listedIn this problem, the items are delivered to the agent without informing the full sequence information.
-
24 Aug 2021 2 repositories listedAn attack is a small yet carefully-crafted perturbations to fail predictors.
-
1 Aug 2021 2 repositories listedPer-pixel ground truth labeling of such datasets, however, is labor-intensive and expensive.
-
6 May 2021 2 repositories listedTo guarantee that machine learning models yield outputs that are not only accurate, but also robust, recent works propose formally verifying robustness properties of machine learning models.
-
5 May 2021 2 repositories listedWe propose a new obstacle segmentation performance evaluation protocol that reflects the detection accuracy in a way meaningful for practical USV navigation.
-
9 Apr 2021 2 repositories listed Syntology official: harvested, nothing ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples)This has motivated a large number of techniques for finding unsafe behavior in DNNs.
-
19 Sep 2018 2 repositories listedOur approach can check different safety properties and find concrete counterexamples for networks that are 10× larger than the ones supported by existing analysis techniques.
-
28 Sep 2017 2 repositories listedWe validate the learned sensor-level collision avoidance policy in a variety of simulated scenarios with thorough performance evaluations and show that the final learned policy is able to find time efficient…
-
16 Sep 2017 2 repositories listedThis paper proposes a methodology for non-uniform sampling, whereby a sampling distribution is learned from demonstrations, and then used to bias sampling.
-
11 Jun 2025 1 repository listedThis paper introduces ECAM (Environmental Collision Avoidance Module), a contrastive learning-based module to enhance collision avoidance ability with the environment.
-
14 Apr 2025 1 repository listedOur experiments demonstrate that the EVS model achieves a significantly higher effective frame rate (1 kHz) and lower temporal (-20 ms) and spatial prediction errors (-20 mm) compared to the RGB-based model…
-
5 Apr 2025 1 repository listedEnsuring safety for autonomous robots operating in dynamic environments can be challenging due to factors such as unmodeled dynamics, noisy sensor measurements, and partial observability.
-
27 Mar 2025 1 repository listedThis paper introduces AUTOBargeSim, a simulation toolbox for autonomous inland vessel guidance and control system design.
-
21 Mar 2025 1 repository listedIn this work, we augment reinforcement learning with an inference-time collision model to ensure safe and efficient container management in a waste-sorting facility with limited processing capacity.
-
19 Mar 2025 1 repository listedWe examine the complexity of the standard High-Order Control Barrier Function (HOCBF) approach and propose a truncated Taylor-based approach that reduces design parameters.
-
10 Mar 2025 1 repository listedMovements of maritime vessels are inherently complex and challenging to model due to the dynamic and often unpredictable nature of maritime operations.
-
6 Mar 2025 1 repository listedQuadrupedal robots exhibit remarkable adaptability in unstructured environments, making them well-suited for formation control in real-world applications.
-
21 Feb 2025 1 repository listedThis work addresses the practical problem of distributed formation tracking control of a group of quadrotor vehicles in a relaxed sensing graph topology with a very limited sensor set, where only one leader vehicle can…
-
10 Feb 2025 1 repository listedTo tackle this challenge, we introduce a new framework that applies sheaf theory to decentralized deep reinforcement learning, enabling agents to learn geometric cross-dependencies between each other through local…
-
7 Feb 2025 1 repository listedHowever, existing simulators often lack high-level autonomy, hindering their immediate applicability to complex tasks such as autonomous navigation in unknown environments.
-
6 Jan 2025 1 repository listedThe latent space can be more easily explored during the search for a proposal distribution, and samples from the proposal distribution are recovered in the space of the target distribution via the invertible mapping.
-
27 Nov 2024 1 repository listedAfter that, a reinforcement learning controller with a novel reward function is designed to balance the target approach and flight trajectory smoothness, satisfying the specific dynamic constraints and stability…
-
26 Nov 2024 1 repository listed
-
23 Oct 2024 1 repository listed
-
14 Oct 2024 1 repository listed
-
9 Oct 2024 1 repository listed
-
25 Sep 2024 1 repository listed
-
25 Sep 2024 1 repository listed
-
29 Jul 2024 1 repository listed
-
17 Jul 2024 1 repository listed
-
15 Jul 2024 1 repository listed
-
16 May 2024 1 repository listed
-
15 May 2024 1 repository listed
-
1 May 2024 1 repository listed
-
11 Mar 2024 1 repository listed
-
5 Mar 2024 1 repository listed
-
16 Feb 2024 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
2 Feb 2024 1 repository listed
-
20 Jan 2024 1 repository listed
-
21 Nov 2023 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
12 Nov 2023 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
27 Oct 2023 1 repository listed
-
2 Oct 2023 1 repository listed
-
20 Sep 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)
-
23 Aug 2023 1 repository listed
-
14 Aug 2023 1 repository listed
-
21 Jul 2023 1 repository listed
-
8 Jul 2023 1 repository listed
-
23 Jun 2023 1 repository listed
-
20 Jun 2023 1 repository listed
-
19 Jun 2023 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples)
-
15 Jun 2023 1 repository listed
-
15 Jun 2023 1 repository listed
-
9 Jun 2023 1 repository listed
-
13 May 2023 1 repository listed
-
12 May 2023 1 repository listed
-
31 Mar 2023 1 repository listed
-
22 Dec 2022 1 repository listed
-
31 Oct 2022 1 repository listed
-
17 Oct 2022 1 repository listed
-
2 Oct 2022 1 repository listed
-
17 Sep 2022 1 repository listed
-
5 Jul 2022 1 repository listed
-
4 Jul 2022 1 repository listed
-
27 Jun 2022 1 repository listed
-
22 Jun 2022 1 repository listed
-
4 May 2022 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples)
-
30 Mar 2022 1 repository listed
-
3 Feb 2022 1 repository listed
-
17 Jan 2022 1 repository listed
-
17 Dec 2021 1 repository listed
-
28 Sep 2021 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 7 harvested samples)
-
24 Aug 2021 1 repository listed
-
30 Jun 2021 1 repository listed
-
21 Jun 2021 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
26 Mar 2021 1 repository listed
-
18 Mar 2021 1 repository listed
-
4 Mar 2021 1 repository listed
-
2 Mar 2021 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
1 Mar 2021 1 repository listed
-
21 Feb 2021 1 repository listed
-
16 Feb 2021 1 repository listed
-
31 Dec 2020 1 repository listed
-
23 Dec 2020 1 repository listed
-
14 Dec 2020 1 repository listed
-
23 Oct 2020 1 repository listed
-
19 Oct 2020 1 repository listed
-
3 Aug 2020 1 repository listed
-
29 Jul 2020 1 repository listed
-
17 Jul 2020 1 repository listed
-
16 Jul 2020 1 repository listed
Syntology lines on 15 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections