{"id":"W2998030398","doi":"10.1609/aaai.v34i05.6219","title":"Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Lockheed Martin; National Science Foundation","keywords":"Bipartite graph; Constraint (computer-aided design); Mathematical optimization; Computer science; Reduction (mathematics); Graph; Pathfinding; Search algorithm; State (computer science); Theoretical computer science; Algorithm; Mathematics; Shortest path problem","routes":{"ca_aff":true,"ca_fund":true,"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.0005132171,0.0002324701,0.0003218141,0.00008523693,0.00019804,0.0002922964,0.001363092,0.00009354241,0.00001671861],"category_scores_gemma":[0.0005235474,0.0001862412,0.0001031707,0.0004555607,0.0005734224,0.0002320816,0.0002546204,0.0002470003,0.00002938225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002060317,"about_ca_system_score_gemma":0.0001729659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121509,"about_ca_topic_score_gemma":4.0933e-7,"domain_scores_codex":[0.9980474,0.00002380103,0.0004724701,0.0006024726,0.000430857,0.000423029],"domain_scores_gemma":[0.9985587,0.000195497,0.0002333195,0.0002030637,0.0005927535,0.0002166572],"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.0002531725,0.0001103767,0.0003117731,0.0001538743,0.00003765862,0.000001692401,0.003348121,0.002811589,0.185429,0.7343881,0.0004356759,0.07271901],"study_design_scores_gemma":[0.00007206715,0.000241591,0.00005837291,0.00006969643,0.000008472745,0.000002097491,0.0001151405,0.5405444,0.4559056,0.002761903,0.00007331885,0.0001473015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2426118,0.00004188643,0.7339831,0.02091022,0.0003082811,0.001083049,0.00003282682,0.0001977537,0.00083107],"genre_scores_gemma":[0.9210455,0.00001381369,0.07781643,0.0009700486,0.0000743319,0.00003965403,0.000001076049,0.00001389655,0.00002520227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7316262,"threshold_uncertainty_score":0.7594695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1593762805059103,"score_gpt":0.3223359100591781,"score_spread":0.1629596295532678,"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."}}