{"id":"W2292954498","doi":"10.1109/lra.2016.2522096","title":"Mixed-Integer and Constraint Programming Techniques for Mobile Robot Task Planning","year":2016,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Constraint programming; Robot; Integer programming; Task (project management); Computer science; Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Plan (archaeology); Mobile robot; Integer (computer science); Motion planning; Artificial intelligence; Mathematics; Algorithm; Stochastic programming; Engineering; Programming language","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.0001716399,0.0001107025,0.0001121157,0.0001063002,0.0001338365,0.0001877554,0.00008100375,0.000049167,0.000001718286],"category_scores_gemma":[0.00002109604,0.00008574772,0.00002865563,0.00007625024,0.00009338625,0.0003742772,0.0000262538,0.0000416477,0.000001250013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002615921,"about_ca_system_score_gemma":0.00001746988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001939696,"about_ca_topic_score_gemma":0.000001036035,"domain_scores_codex":[0.9992736,0.00002316409,0.0001961069,0.0002464027,0.00009547103,0.0001652311],"domain_scores_gemma":[0.9995391,0.0001278595,0.0001012891,0.0001196535,0.0000501417,0.0000619874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003564759,0.00001778815,0.000873252,0.00004241603,0.00002282807,0.00000348408,0.0003990057,0.01420589,0.04005206,0.01408275,0.0006767472,0.9296202],"study_design_scores_gemma":[0.00124725,0.0002339029,0.003152034,0.0004186134,0.00003399717,0.0001383933,0.0001828753,0.968584,0.01830077,0.001014309,0.005975591,0.0007182563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006282179,0.00002161137,0.9880998,0.004673329,0.0002163619,0.0003748191,0.000003566111,0.0003100571,0.00001825051],"genre_scores_gemma":[0.611046,0.00001198188,0.3883303,0.0004918389,0.00003796223,0.00005920496,0.000002306849,0.00000701909,0.00001345053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9543781,"threshold_uncertainty_score":0.3496691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01616640003394109,"score_gpt":0.2481487157063605,"score_spread":0.2319823156724194,"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."}}