{"id":"W4312361846","doi":"10.1016/j.ifacol.2022.10.419","title":"Long-Horizon Informative Path Planning with Obstacles and Time Constraints","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Senter for Autonome Marine Operasjoner og Systemer; Norges Forskningsråd; Réseau de cancérologie Rossy","keywords":"Planner; Path (computing); Motion planning; Time horizon; Obstacle; Constraint (computer-aided design); Mathematical optimization; Computer science; Horizon; Operations research; Set (abstract data type); Variance (accounting); Excursion; Operations management; Mathematics; Engineering; Artificial intelligence; Economics; Robot; Geography","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003325321,0.0002333718,0.0002652829,0.0001287657,0.0004303385,0.0001282825,0.0005564383,0.00004304364,0.00006146226],"category_scores_gemma":[0.00003806982,0.0002024932,0.00003336087,0.000369413,0.0001697262,0.0005049219,0.0004151302,0.0003813115,0.00003478932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007678929,"about_ca_system_score_gemma":0.0001299378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001107829,"about_ca_topic_score_gemma":3.033182e-7,"domain_scores_codex":[0.9983413,0.00009241951,0.0002468492,0.0003978302,0.0005099564,0.0004116086],"domain_scores_gemma":[0.9990957,0.0001894261,0.0001679493,0.0003384238,0.00005223466,0.0001562982],"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.0004823474,0.001006324,0.05774781,0.000294288,0.0009486874,0.00842992,0.1217506,0.1376647,0.004221421,0.008680808,0.001032739,0.6577404],"study_design_scores_gemma":[0.003037284,0.00294738,0.02755535,0.0002371595,0.0000470659,0.002170913,0.004133903,0.9571078,0.0002658706,0.0002956184,0.0009328066,0.001268885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4850328,0.0009790802,0.4991693,0.002176053,0.0007341035,0.0009039781,0.0002836947,0.001137208,0.009583823],"genre_scores_gemma":[0.1004112,0.000005196985,0.8983054,0.0004953406,0.00007823773,0.00003307092,0.00007328963,0.00002173271,0.000576582],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8194431,"threshold_uncertainty_score":0.8257433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01143587202730603,"score_gpt":0.2288166528117103,"score_spread":0.2173807807844043,"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."}}