{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425517,0.0009042008,0.0006886044,0.001021784,0.000568986,0.0007015169,0.001461584,0.001087778,0.003920265],"category_scores_gemma":[0.002420005,0.0005432801,0.0008648409,0.001295406,0.0004883691,0.001219818,0.001312207,0.001019139,0.0008784621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000625217,"about_ca_system_score_gemma":0.001799984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005152714,"about_ca_topic_score_gemma":0.004973332,"domain_scores_codex":[0.9995504,0.00009271424,0.00002258315,0.00006666229,0.0002164019,0.00005117965],"domain_scores_gemma":[0.9995961,0.0001500293,0.00005686418,0.00005339166,0.0001153793,0.00002838672],"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.0001718263,0.00008211486,0.0006203629,0.000229492,0.00006381136,0.0001307032,0.000176576,0.5863585,0.01396588,0.04142763,0.004920404,0.3518527],"study_design_scores_gemma":[0.00001979545,0.00004103061,0.00005927026,0.00001372592,0.000009393563,0.00004707697,0.00001275014,0.9875991,0.001954824,0.006795979,0.003435718,0.0000111993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002309656,0.0001321652,0.9961079,0.0000409134,0.00002125736,0.000033334,0.00002585549,0.0002582505,0.001070719],"genre_scores_gemma":[0.1342277,0.0004053202,0.8616248,0.00009956357,0.00002800467,0.0003738008,0.0001913425,0.0002433161,0.002806158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005152714,"threshold_uncertainty_score":0.01311457,"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."}}