{"id":"W1502476217","doi":"10.1007/11861201_69","title":"Modeling Robot Path Planning with CD++","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Computer science; Motion planning; DEVS; Robot; Formalism (music); Path (computing); Route planning; Routing (electronic design automation); Distributed computing; Simulation; Artificial intelligence; Mathematical optimization; Modeling and simulation; Computer network; Mathematics","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"],"consensus_categories":[],"category_scores_codex":[0.0002017593,0.0004207548,0.0003538867,0.0003297995,0.0001145195,0.0001779981,0.0006792459,0.0002078541,0.00001735155],"category_scores_gemma":[0.000006437985,0.0003499274,0.00005383668,0.0001835665,0.0001708542,0.0001572324,0.0001224762,0.0006722058,0.00001476055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000152212,"about_ca_system_score_gemma":0.00008007306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003590804,"about_ca_topic_score_gemma":0.0000416266,"domain_scores_codex":[0.9980576,0.00000481077,0.0003060465,0.0006370404,0.0005103812,0.0004840959],"domain_scores_gemma":[0.9992351,0.00005538578,0.0000427343,0.0005026119,0.00007813511,0.0000860584],"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.000001883295,0.000002935875,0.00001973642,0.00003222066,0.000006007334,0.00007735493,0.0001495891,0.9382797,0.00006104825,0.0002420145,0.00001170625,0.06111584],"study_design_scores_gemma":[0.00006085412,0.0000461179,0.00001123801,0.0005670922,0.000006659932,0.00003935757,1.158531e-7,0.9929873,0.0004389466,0.005161243,0.0002049748,0.0004760521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004054171,0.0009481502,0.9922816,0.00002029962,0.0005652237,0.0001643971,0.000002934248,0.0002032781,0.005408738],"genre_scores_gemma":[0.8189601,0.00003231921,0.180084,0.0001494469,0.000458578,0.000005222114,0.000009847551,0.00008668882,0.0002137583],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8185547,"threshold_uncertainty_score":0.9998953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01795951545977173,"score_gpt":0.2176955740607019,"score_spread":0.1997360586009301,"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."}}