MétaCan
Menu
Back to cohort
Record W4205779814 · doi:10.1109/smc52423.2021.9658635

Multi-Agent Formation Control With Obstacle Avoidance Using Proximal Policy Optimization

2021· article· en· W4205779814 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venue2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC) · 2021
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsObstacleObstacle avoidanceComputer scienceReinforcement learningCentroidControl (management)Field (mathematics)Order (exchange)Multi-agent systemHolonomicState informationArtificial intelligenceDistributed computingState (computer science)RobotAlgorithmMobile robotMathematicsBusiness

Abstract

fetched live from OpenAlex

In this paper, a formation of second-order holonomic agents is made to navigate through an obstacle field using proximal policy optimization (PPO) based deep reinforcement learning (DRL). The angle-based formation is allowed to shrink while maintaining its shape in order to navigate through tight spaces and take the geometric centroid of the formation towards the goal. Two reward schemes are presented, one based on the actions of individual agents and another based on the actions of the team as a whole. For each case, all the agents share a single policy that is trained in a centralized manner. Distance measurements, state information, error information regarding neighboring agents, and simulation information are used for training each policy in an end-to-end fashion. Simulation results for both approaches are compared.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.970
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.054
GPT teacher head0.287
Teacher spread0.233 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it