{"id":"W2965434695","doi":"10.1609/socs.v10i1.18492","title":"Unbounded Sub-Optimal Conflict-Based Search in Complex Domains","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":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Constraint (computer-aided design); Computer science; Mathematical optimization; Exploit; Axiom; Action (physics); 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.00152698,0.0007791166,0.0009955718,0.0007024397,0.0006605302,0.001129941,0.001399969,0.0009806836,0.003990333],"category_scores_gemma":[0.007191786,0.0005499431,0.0005851229,0.001238265,0.001206455,0.002004297,0.002117612,0.001404185,0.000328484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000997589,"about_ca_system_score_gemma":0.001476278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006468958,"about_ca_topic_score_gemma":0.006558323,"domain_scores_codex":[0.9991853,0.0003412307,0.00004964008,0.0001283713,0.000176504,0.0001188766],"domain_scores_gemma":[0.994615,0.00432916,0.0002467527,0.000291241,0.0003218381,0.0001960416],"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.0001191758,0.00005839163,0.0003986761,0.00009393867,0.00002435904,0.00008797202,0.0001110137,0.9369229,0.001001051,0.03337043,0.001288596,0.02652341],"study_design_scores_gemma":[0.00002227157,0.0000185197,0.00005180538,0.000008147569,0.000004361341,0.00001400637,0.00002259414,0.9826455,0.000371488,0.01634859,0.0004879738,0.00000457643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.102509,0.0003587757,0.8875853,0.0004724535,0.000036545,0.0001402528,0.0002119247,0.0005281825,0.008157576],"genre_scores_gemma":[0.5815786,0.0002242652,0.4139791,0.0002131588,0.00002203666,0.0002865312,0.000356391,0.0002037102,0.003136024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006468958,"threshold_uncertainty_score":0.01334894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03299882872112784,"score_gpt":0.2861712336286616,"score_spread":0.2531724049075337,"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."}}