{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002291,0.0003713726,0.0008417916,0.0003685608,0.0002380715,0.0006473841,0.001307134,0.0001621498,0.000001885022],"category_scores_gemma":[0.0001798771,0.0003056474,0.0003298022,0.0004451919,0.00005580077,0.0006161898,0.0001251639,0.0005025501,0.00002447466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007604137,"about_ca_system_score_gemma":0.0005284502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001601133,"about_ca_topic_score_gemma":0.000001740642,"domain_scores_codex":[0.9957206,0.0002748564,0.001588932,0.0004489124,0.001208496,0.0007582358],"domain_scores_gemma":[0.996468,0.0007387081,0.001022457,0.0004933104,0.001038945,0.0002385458],"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.00003211609,0.0001129537,0.001161788,0.0001079775,0.0001210186,0.0002700828,0.001430106,0.9912027,0.0007638194,0.002769052,0.0009908924,0.001037517],"study_design_scores_gemma":[0.0006584961,0.000580701,0.001037494,0.001114065,0.00004397296,0.001398391,0.0008756093,0.9924937,0.0005605125,0.0004538069,0.0004169657,0.0003662953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002421243,0.004841676,0.988255,0.0003264268,0.003299351,0.0005595631,0.000003165088,0.00007310612,0.0002204504],"genre_scores_gemma":[0.5995364,0.00002508248,0.3986036,0.0000547593,0.0006731796,0.000026213,0.000005168252,0.00004307913,0.001032515],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5971151,"threshold_uncertainty_score":0.9999396,"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."}}