{"id":"W2151397305","doi":"10.1109/acc.2003.1243400","title":"Disjoint path algorithms for planar reconfiguration of identical vehicles","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Control reconfiguration; Diagonal; Bipartite graph; Planar; Algorithm; Computer science; Matching (statistics); Path (computing); Disjoint sets; Grid; Mathematics; Theoretical computer science; Combinatorics; Graph; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182815,0.0009009423,0.0006379006,0.001012605,0.0006463684,0.0008477176,0.001273264,0.0008743319,0.006189311],"category_scores_gemma":[0.002540653,0.0003860196,0.0006402478,0.001655936,0.0005590908,0.001906098,0.001636947,0.0009005706,0.001394396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007298767,"about_ca_system_score_gemma":0.000729259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001831153,"about_ca_topic_score_gemma":0.001658777,"domain_scores_codex":[0.9992926,0.0001814851,0.00004028122,0.0001830612,0.0001716447,0.0001308504],"domain_scores_gemma":[0.9994094,0.0002729018,0.00009058596,0.0001197125,0.00006712404,0.00004037824],"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.0002485584,0.0001248824,0.0002770797,0.0002352702,0.00006785143,0.0001177201,0.000143543,0.4500787,0.005469381,0.09126681,0.005709979,0.4462602],"study_design_scores_gemma":[0.0001350704,0.0001974495,0.0003173065,0.00002468555,0.00004268036,0.0001510755,0.00007418889,0.8144546,0.004376734,0.1651984,0.0149903,0.00003765979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01132235,0.0003664268,0.9819993,0.0001186834,0.00005969893,0.0001116254,0.0001102669,0.001018285,0.00489345],"genre_scores_gemma":[0.2228649,0.0006723526,0.7677521,0.0001301507,0.00005862658,0.0003287196,0.0008434232,0.0002397588,0.007110022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006189311,"threshold_uncertainty_score":0.02070534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01835708489978231,"score_gpt":0.2399861075397923,"score_spread":0.22162902264001,"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."}}