{"id":"W2965387939","doi":"10.1609/socs.v10i1.18498","title":"Revisiting Suboptimal Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounded function; Search algorithm; Beam search; Iterative deepening depth-first search; Best-first search; Computer science; Mathematical optimization; Upper and lower bounds; Incremental heuristic search; Beam stack search; Bidirectional search; Node (physics); Search problem; Mathematics; Algorithm","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.005500015,0.001332342,0.001584048,0.001111295,0.001540767,0.00333378,0.002473477,0.001963746,0.00865224],"category_scores_gemma":[0.02771166,0.0007815545,0.001142439,0.001503357,0.004435106,0.005219081,0.004640667,0.004468151,0.002792301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002740376,"about_ca_system_score_gemma":0.003850038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006137548,"about_ca_topic_score_gemma":0.006657465,"domain_scores_codex":[0.9935074,0.003049491,0.0003131113,0.0009414293,0.001818167,0.0003703171],"domain_scores_gemma":[0.987513,0.008593864,0.0003352969,0.001827923,0.001458779,0.0002711529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001206766,0.00005092497,0.0008121394,0.0005554055,0.00007278758,0.0001393931,0.0004413923,0.1416893,0.001296657,0.6978952,0.01454786,0.1423783],"study_design_scores_gemma":[0.00004204573,0.00008390335,0.0001970478,0.0003619555,0.00004151097,0.0001477673,0.0001512266,0.3378531,0.001325555,0.6050939,0.0546679,0.00003403948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005201817,0.004339911,0.9609553,0.002470946,0.0004668358,0.00006215953,0.00009643481,0.0004581349,0.02594846],"genre_scores_gemma":[0.2910409,0.007447928,0.6792922,0.002645852,0.0007103088,0.0003139218,0.0004475899,0.0009646482,0.0171367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00865224,"threshold_uncertainty_score":0.02908725,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02214453960801229,"score_gpt":0.2754653915602443,"score_spread":0.253320851952232,"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."}}