{"id":"W25902527","doi":"10.1007/978-3-642-10238-7_6","title":"Voronoi-assisted Parallel Bidirectional Heuristic Search","year":2009,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Heuristic; Speedup; Computer science; Overhead (engineering); Voronoi diagram; Process (computing); Heuristics; Variety (cybernetics); Exponential function; Algorithm; Parallel computing; Artificial intelligence; 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.001273112,0.0002428616,0.0002725273,0.001163944,0.0005975403,0.000735392,0.003892515,0.0001426797,0.000006473304],"category_scores_gemma":[0.0000513752,0.0002508176,0.00004987182,0.000557069,0.0007220971,0.004634963,0.001744904,0.0005963161,0.0001437781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002312877,"about_ca_system_score_gemma":0.0005076778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001630862,"about_ca_topic_score_gemma":0.000002054175,"domain_scores_codex":[0.9978893,0.00005141442,0.0006852146,0.000360586,0.0007000255,0.00031344],"domain_scores_gemma":[0.9967286,0.0002696939,0.0002537791,0.002161245,0.0004338814,0.0001528132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001526217,0.00002227532,0.00002882263,0.00001338697,0.000005601725,0.000001634403,0.0008035047,0.003102826,0.000001166523,0.3784911,0.0004386165,0.6170896],"study_design_scores_gemma":[0.0002524807,0.0000685646,0.008950988,0.0001804014,0.000004157826,0.0001032178,0.000005889025,0.922985,0.000001668178,0.005833362,0.061267,0.0003473342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000007787218,0.0003254891,0.7942951,0.001336096,0.0003417793,0.0002679589,0.000007904004,0.000162607,0.2032553],"genre_scores_gemma":[0.004458705,0.001340521,0.9883785,0.001031618,0.0000661946,0.00001946346,0.00007570017,0.000009728121,0.004619574],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9198821,"threshold_uncertainty_score":0.9999944,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06442006760290148,"score_gpt":0.3130405021155389,"score_spread":0.2486204345126374,"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."}}