{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109123,0.0002119556,0.0002874984,0.0002044175,0.0001668346,0.0003882357,0.00294042,0.0001210187,0.00002116095],"category_scores_gemma":[0.0002469731,0.0001887797,0.0001467161,0.0009239774,0.0001676957,0.0002948582,0.0009497933,0.0005681875,0.00002799571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004610777,"about_ca_system_score_gemma":0.0003670368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001360362,"about_ca_topic_score_gemma":0.000002019993,"domain_scores_codex":[0.9964143,0.00006442237,0.0004624643,0.0005983429,0.001987501,0.000472994],"domain_scores_gemma":[0.9979314,0.0003333899,0.0001419016,0.0003121276,0.001155336,0.0001259026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002514007,0.001116579,0.01438609,0.00007415406,0.0001030742,0.00004267355,0.001153289,0.009821972,0.378466,0.5922363,0.001801539,0.0005469504],"study_design_scores_gemma":[0.004355362,0.0003470737,0.01639252,0.0002563232,0.000009159608,0.00004565194,0.0001215517,0.2791389,0.6912177,0.005151106,0.002545501,0.0004192362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9560428,0.0000199695,0.002208418,0.02249154,0.004331697,0.0005049445,0.00002097372,0.0001256839,0.01425393],"genre_scores_gemma":[0.9917939,0.00000861618,0.007410068,0.0003113145,0.0002454335,0.0000224061,0.000009796829,0.00002052511,0.0001779343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5870852,"threshold_uncertainty_score":0.7698212,"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."}}