{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002637792,0.001686324,0.001130277,0.001180749,0.0007493932,0.001854982,0.002102628,0.001059073,0.007942156],"category_scores_gemma":[0.005532339,0.001125374,0.001536889,0.003215934,0.0007786861,0.002152145,0.001546958,0.003736632,0.001253094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115187,"about_ca_system_score_gemma":0.001887169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008828691,"about_ca_topic_score_gemma":0.01509978,"domain_scores_codex":[0.9981705,0.0008759134,0.0001132186,0.0001916314,0.0005158401,0.0001329126],"domain_scores_gemma":[0.9972866,0.002040582,0.0001890524,0.0001263585,0.00028768,0.00006975925],"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.0001103694,0.0001025011,0.0002377119,0.0005376753,0.0001594104,0.0001521387,0.0001255577,0.648377,0.001746984,0.1310421,0.01236,0.2050487],"study_design_scores_gemma":[0.00001796828,0.00002300333,0.00005024346,0.00004756184,0.00001665802,0.00002639073,0.00002177469,0.9403238,0.0005412022,0.05096663,0.007952525,0.00001221261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004657232,0.0005309105,0.9960556,0.0002434154,0.00008824495,0.00003779706,0.00005561634,0.000126074,0.002396644],"genre_scores_gemma":[0.03848744,0.001159547,0.9557651,0.0002227663,0.0001455015,0.0002804915,0.0001646531,0.000181182,0.003593334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008828691,"threshold_uncertainty_score":0.02656919,"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."}}