{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381252,0.001005281,0.000869785,0.001088482,0.0006726877,0.0009960785,0.001802452,0.00104887,0.00905945],"category_scores_gemma":[0.006222215,0.0006290172,0.000949366,0.001823664,0.001063826,0.001652932,0.002296295,0.002320807,0.001436288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008384463,"about_ca_system_score_gemma":0.001572759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003774436,"about_ca_topic_score_gemma":0.004867443,"domain_scores_codex":[0.9980404,0.0009991549,0.00006446481,0.0002328049,0.0005370446,0.0001261473],"domain_scores_gemma":[0.9978753,0.001244815,0.0001348429,0.0003901649,0.0002625936,0.00009229989],"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.0001368096,0.0001418427,0.0003686656,0.0003009411,0.00005378334,0.0001381219,0.0001561375,0.6945788,0.00517697,0.1526801,0.005992681,0.1402751],"study_design_scores_gemma":[0.00002996286,0.00002813252,0.00007658569,0.00002188737,0.000009321082,0.00004772137,0.00002237419,0.9254269,0.001475063,0.06784139,0.005007948,0.00001275404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004254351,0.0001153492,0.9912533,0.0001037891,0.0000226096,0.00007280117,0.0001067239,0.0003468798,0.003724181],"genre_scores_gemma":[0.1168038,0.0002157351,0.878936,0.0001589548,0.00002897121,0.0003871037,0.0006966777,0.0003616964,0.002410977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00905945,"threshold_uncertainty_score":0.03030694,"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."}}