{"id":"W3127566536","doi":"10.1109/lra.2021.3056346","title":"Optimal Cooperative Maneuver Planning for Multiple Nonholonomic Robots in a Tiny Environment via Adaptive-Scaling Constrained Optimization","year":2021,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Nonholonomic system; Convexity; Mathematical optimization; Computer science; Trajectory; Robot; Computation; Kinematics; Convergence (economics); Control theory (sociology); Range (aeronautics); Constraint (computer-aided design); Trajectory optimization; Motion planning; Mobile robot; Optimal control; Mathematics; Artificial intelligence; Engineering; Algorithm; Control (management)","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004574663,0.000942369,0.0006995241,0.0003390027,0.0003945675,0.000581518,0.0006986959,0.0006363243,0.001042897],"category_scores_gemma":[0.001132921,0.0004621038,0.0004906368,0.000379262,0.000899305,0.0006094135,0.001341298,0.0006666747,0.0001525213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005306542,"about_ca_system_score_gemma":0.0009288773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006185898,"about_ca_topic_score_gemma":0.004053352,"domain_scores_codex":[0.9998184,0.00004979361,0.00000726783,0.00004635799,0.00004909725,0.00002913371],"domain_scores_gemma":[0.9996306,0.0002068941,0.00005675237,0.00003063091,0.00004234655,0.00003284907],"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.00001761837,0.000007655768,0.0001319432,0.00001776199,0.000009179617,0.00003508011,0.00003305853,0.9908744,0.0007790363,0.00249312,0.0001326818,0.00546845],"study_design_scores_gemma":[0.000002647773,0.000009593878,0.0000287271,0.000001395523,0.000001158307,0.000003329859,0.000006118938,0.9987722,0.00008986021,0.0009875951,0.00009621416,0.000001229496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04282223,0.000132367,0.9536552,0.0001355588,0.00002157157,0.00003970879,0.00002186654,0.0001715867,0.002999968],"genre_scores_gemma":[0.8785437,0.0001320224,0.1188544,0.00006336717,0.00002258491,0.0002048193,0.00007015604,0.00006822777,0.002040709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006185898,"threshold_uncertainty_score":0.01229978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02128553484344437,"score_gpt":0.2351833953322822,"score_spread":0.2138978604888378,"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."}}