{"id":"W4386883446","doi":"10.1109/rcar58764.2023.10249227","title":"Focused Bidirectional Search Trees: A Bidirectional Optimal Fast Matching Method for Robot Path Planning","year":2023,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Fast marching method; Motion planning; Computer science; Heuristic; Path (computing); Bidirectional search; Vertex (graph theory); Any-angle path planning; Matching (statistics); Robot; Mathematical optimization; Set (abstract data type); Beam search; Algorithm; Brute force; Search algorithm; Artificial intelligence; Incremental heuristic search; Theoretical computer science; 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.001737845,0.0002633118,0.0003078262,0.0005654988,0.0005478076,0.0003057077,0.0007680689,0.000123878,0.00002623224],"category_scores_gemma":[0.0001152198,0.0002476779,0.0001797063,0.001386598,0.00003322961,0.0005043939,0.0003109496,0.0002859551,0.0001617117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131129,"about_ca_system_score_gemma":0.0002322608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000162683,"about_ca_topic_score_gemma":0.000002377167,"domain_scores_codex":[0.9971721,0.000178751,0.0003718694,0.0008184178,0.000704121,0.0007547844],"domain_scores_gemma":[0.9978724,0.001286676,0.00008707321,0.000400125,0.0001578643,0.0001958692],"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.00003070485,0.00007349376,0.0005763862,0.00002699364,0.0001061891,0.00006764258,0.002335058,0.9228339,0.003984155,0.004663548,0.009144835,0.05615706],"study_design_scores_gemma":[0.0006090933,0.0001355494,0.00598844,0.00005623197,0.000008556834,0.00009839652,0.0002405861,0.9887311,0.001502186,0.001120869,0.00118418,0.0003247996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002834781,0.00003277587,0.9918059,0.00100436,0.001139416,0.0003196935,0.00002264923,0.001690582,0.001149811],"genre_scores_gemma":[0.005120391,0.000002450756,0.9898942,0.000145597,0.0003932801,0.0001457796,0.00004090699,0.00003735402,0.004220018],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06589718,"threshold_uncertainty_score":0.9999976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06730620531167672,"score_gpt":0.3483778810909097,"score_spread":0.281071675779233,"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."}}