{"id":"W99943456","doi":"","title":"Dynamic control in path-planning with real-time heuristic search","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Incremental heuristic search; Heuristic; Motion planning; Computation; Consistent heuristic; Path (computing); Mathematical optimization; Bidirectional search; Bounded function; Search algorithm; Quality (philosophy); Constant (computer programming); Control (management); Any-angle path planning; Beam search; Algorithm; Artificial intelligence; Mathematics; Robot","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.0008907877,0.0001164431,0.0001562461,0.0001734971,0.00006043663,0.00009245233,0.0005840121,0.00004934595,0.00005027158],"category_scores_gemma":[0.00004083118,0.00009207935,0.00002163556,0.0004592168,0.00007747555,0.0002473107,0.00007761917,0.0001635461,0.0003242289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008293807,"about_ca_system_score_gemma":0.00006644829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004175892,"about_ca_topic_score_gemma":0.0001519663,"domain_scores_codex":[0.9985572,0.00005119023,0.0002649267,0.0003367505,0.0003110155,0.0004789057],"domain_scores_gemma":[0.9989735,0.0004335105,0.00003901796,0.0003805585,0.00007561052,0.00009775459],"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.0007468051,0.0009481417,0.297285,0.00009488113,0.0001210662,0.007796757,0.02198835,0.0752256,0.08685973,0.168769,0.001822883,0.3383418],"study_design_scores_gemma":[0.0001903357,0.0002026712,0.02349346,0.0000549789,0.000002444202,0.0000331213,0.0002772254,0.9714571,0.002311623,0.001636397,0.0001035201,0.0002371582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2026951,0.00001954294,0.7835827,0.000225798,0.00005141562,0.0001490849,4.325972e-7,0.0001530736,0.01312287],"genre_scores_gemma":[0.9623335,0.000002823386,0.03662275,0.0001727041,0.00001513504,0.000004039846,6.231335e-7,0.000009312598,0.0008391101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8962315,"threshold_uncertainty_score":0.4167414,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01679336877876427,"score_gpt":0.301201797562249,"score_spread":0.2844084287834847,"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."}}