{"id":"W4205779814","doi":"10.1109/smc52423.2021.9658635","title":"Multi-Agent Formation Control With Obstacle Avoidance Using Proximal Policy Optimization","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Obstacle; Obstacle avoidance; Computer science; Reinforcement learning; Centroid; Control (management); Field (mathematics); Order (exchange); Multi-agent system; Holonomic; State information; Artificial intelligence; Distributed computing; State (computer science); Robot; Algorithm; Mobile robot; Mathematics; Business","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003278628,0.0003467297,0.0004057974,0.0002226632,0.0001887169,0.001213631,0.0006520529,0.0001371924,0.00003301887],"category_scores_gemma":[0.00009324236,0.0003258131,0.00007390027,0.0003329451,0.00006938594,0.0007934188,0.0001041178,0.00021218,0.00004722796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003474338,"about_ca_system_score_gemma":0.0003928622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003024823,"about_ca_topic_score_gemma":0.00008247291,"domain_scores_codex":[0.997061,0.0002764493,0.0006835938,0.0006973052,0.0008710893,0.0004106033],"domain_scores_gemma":[0.9974501,0.00008813681,0.0004961122,0.0005340161,0.001246979,0.0001847299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002532735,0.0008707923,0.002686044,0.0003773356,0.0007271389,0.0004092255,0.002086642,0.633763,0.02831855,0.3239791,0.0005356894,0.005993251],"study_design_scores_gemma":[0.002454499,0.00009693404,0.0005097477,0.0003886853,0.00002860466,0.0001984938,0.0003711984,0.9929848,0.001112764,0.00005019516,0.00143406,0.000370072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01714145,0.000248939,0.9769517,0.00101646,0.001234789,0.0006587329,0.0001373049,0.00009223795,0.002518351],"genre_scores_gemma":[0.9867567,0.00009932026,0.01057446,0.0002563859,0.0003412158,0.00009008835,0.00008406615,0.00002579428,0.001771967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9696152,"threshold_uncertainty_score":0.9999194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05426866731148646,"score_gpt":0.286836777811927,"score_spread":0.2325681105004405,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}