{"id":"W2010173946","doi":"10.1007/s10846-006-9067-z","title":"A Dynamic Load-Balancing Parallel Search for Enumerative Robot Path Planning","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Queen's University","funders":"","keywords":"Load balancing (electrical power); Computer science; Obstacle; Decomposition; Parallel computing; Motion planning; Mathematical optimization; Idle; Domain decomposition methods; Exploit; Robot; Algorithm; Distributed computing; Mathematics; Engineering; Artificial intelligence","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.0008323515,0.0007563179,0.001272983,0.0009651869,0.001231037,0.00092301,0.002509653,0.001083805,0.00857605],"category_scores_gemma":[0.002208842,0.0005992274,0.000650658,0.001569004,0.0007453514,0.001294347,0.00208283,0.001148953,0.001299698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008733906,"about_ca_system_score_gemma":0.001939143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009332708,"about_ca_topic_score_gemma":0.01314809,"domain_scores_codex":[0.9994588,0.0001144202,0.00002874551,0.0001105761,0.0001996495,0.00008780226],"domain_scores_gemma":[0.9993756,0.0002340607,0.00003891837,0.000125073,0.0001669364,0.00005936766],"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.0006151426,0.0003628137,0.0005958471,0.0001458831,0.00007132285,0.0001063155,0.0001151478,0.5636456,0.009456942,0.01360484,0.00694228,0.4043378],"study_design_scores_gemma":[0.00005780669,0.00004551518,0.00006791613,0.000004056399,0.00000927625,0.00001590155,0.0000101442,0.9949105,0.0006734947,0.003538242,0.0006611828,0.000005947698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02458535,0.0001858572,0.9659414,0.0002050858,0.000117908,0.0001432697,0.0001039373,0.002047336,0.006669817],"genre_scores_gemma":[0.2488856,0.0001119043,0.7437254,0.0001738962,0.00007717413,0.0003908651,0.0002825231,0.0003361341,0.006016447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009332708,"threshold_uncertainty_score":0.0286898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02815106095648535,"score_gpt":0.2942853849438136,"score_spread":0.2661343239873282,"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."}}