{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002261278,0.0001875942,0.0002345553,0.0001205455,0.000153906,0.0001596862,0.000161355,0.0000787115,0.000002740893],"category_scores_gemma":[0.00003476478,0.0002089263,0.00004196865,0.0001449916,0.00005634988,0.0003640134,0.00006171782,0.0001289485,0.0000049147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057202,"about_ca_system_score_gemma":0.00004735013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004942605,"about_ca_topic_score_gemma":4.518632e-7,"domain_scores_codex":[0.9986505,0.0000844778,0.0003556797,0.0004637889,0.0001533203,0.000292252],"domain_scores_gemma":[0.999293,0.0002445729,0.0001486,0.0001989936,0.00004143154,0.00007335887],"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.000006900205,0.00003510939,0.0002387159,0.00001234425,0.00002374832,0.00005309351,0.0008983007,0.9930325,0.004627882,0.0001388029,0.00005106501,0.0008815635],"study_design_scores_gemma":[0.001032561,0.00004436076,0.001418607,0.00007509014,0.0000113054,0.00004314675,0.00006833982,0.9956917,0.001357875,0.00001148327,0.000007994427,0.0002375228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02906443,0.00004505318,0.9685962,0.001591275,0.0002908387,0.0003085347,0.000007280583,0.00008613533,0.00001026258],"genre_scores_gemma":[0.2606603,0.000004097044,0.7387404,0.0004697967,0.00004341774,0.00002846546,0.00003049385,0.0000129223,0.00001013208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2315959,"threshold_uncertainty_score":0.8519766,"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."}}