{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003626915,0.00005235799,0.00007155939,0.0000246383,0.0000179671,0.000007297046,0.00002950632,0.00003369628,0.000007467796],"category_scores_gemma":[0.00002897057,0.00004805157,0.00002292549,0.00002262407,0.00001262733,0.00005906793,0.000002101498,0.0000284958,0.000003008288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000248001,"about_ca_system_score_gemma":0.000004439061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007066905,"about_ca_topic_score_gemma":0.000004789116,"domain_scores_codex":[0.9996701,0.000001614192,0.0001423479,0.00006296963,0.00004412609,0.00007876867],"domain_scores_gemma":[0.9998514,0.00002407692,0.0000163222,0.00006435662,0.00002207258,0.00002179004],"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.000004396712,0.00001086967,0.000003078588,0.00004031929,0.00000747133,3.659206e-7,0.00005146214,0.9810854,0.00143142,0.01364688,0.00008663493,0.003631727],"study_design_scores_gemma":[0.001219916,0.0001539683,0.0007924775,0.0000552962,0.00002403919,0.000004610476,0.0001424131,0.4913284,0.3919852,0.1131541,0.0008359507,0.000303541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00449011,0.00002099361,0.9941352,0.00004488146,0.0001149617,0.0000961982,0.00001190213,0.0001183316,0.0009674248],"genre_scores_gemma":[0.8428505,0.00002609677,0.1569803,0.000009729549,0.00003588061,0.000009612473,0.0000343959,0.00001018441,0.00004329874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8383604,"threshold_uncertainty_score":0.1959486,"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."}}