{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007359668,0.0007174846,0.0005436915,0.0004402507,0.0006879098,0.0006200321,0.001091862,0.001151771,0.001872123],"category_scores_gemma":[0.00238367,0.0003574188,0.0004877248,0.0006771497,0.0008508855,0.0008058551,0.001100806,0.001011268,0.0001223611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008691579,"about_ca_system_score_gemma":0.001404099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009764805,"about_ca_topic_score_gemma":0.01344526,"domain_scores_codex":[0.9996662,0.0001470118,0.00001101414,0.00004083463,0.00006697782,0.0000679775],"domain_scores_gemma":[0.998925,0.0006889269,0.0001285778,0.00006561188,0.00008662445,0.0001051848],"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.00002828151,0.00002057861,0.000155998,0.00001491751,0.000007342682,0.0001028055,0.00002101076,0.9932856,0.0002963836,0.003729681,0.00008970659,0.002247706],"study_design_scores_gemma":[0.00001305174,0.00004317537,0.00006945392,0.000002293887,0.000005035435,0.00001836408,0.00002144216,0.9970121,0.0002979646,0.002325832,0.0001864094,0.000004797648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3216878,0.0002353482,0.6676152,0.0005626117,0.00003891829,0.0001571198,0.000131909,0.0003565557,0.00921453],"genre_scores_gemma":[0.9263831,0.0000710594,0.07161626,0.00003474489,0.000005588407,0.00009058912,0.00005399371,0.00002482857,0.001719803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009764805,"threshold_uncertainty_score":0.01941592,"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."}}