{"id":"W2170141090","doi":"10.1109/tase.2011.2123888","title":"Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Metric (unit); Motion planning; Range (aeronautics); Travelling salesman problem; Approximation algorithm; Mathematical optimization; Visibility; Mathematics; Set cover problem; Set (abstract data type); Cover (algebra); Metric space; Robot; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Engineering","routes":{"ca_aff":true,"ca_fund":false,"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.001262524,0.0001410371,0.0001626394,0.00035331,0.0003693806,0.0001690692,0.0002591358,0.00003776545,4.112572e-7],"category_scores_gemma":[0.00003657761,0.0001222113,0.00001919081,0.001009335,0.0001248603,0.001302653,0.000003972626,0.0001213682,0.000001366393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006641902,"about_ca_system_score_gemma":0.00006973345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000184556,"about_ca_topic_score_gemma":8.371911e-7,"domain_scores_codex":[0.9986605,0.00001452346,0.0002464397,0.0004513133,0.0003343507,0.0002928557],"domain_scores_gemma":[0.9992763,0.000147725,0.00006823929,0.0002386256,0.000128929,0.0001402062],"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.0001295572,0.0002553422,0.0001620874,0.0005381646,0.00006695616,0.00001707955,0.0220415,0.7184137,0.004993753,0.005239564,0.00002282591,0.2481195],"study_design_scores_gemma":[0.0005470713,0.0001466787,0.009424569,0.0001195027,0.000009764324,0.00003040432,0.00004477826,0.9861221,0.003212771,0.0001543255,0.00001737304,0.0001706619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0216495,0.0000567464,0.9772662,0.00007822752,0.0001798468,0.0004190876,0.000009610987,0.0002904193,0.0000503387],"genre_scores_gemma":[0.6198951,0.000007752396,0.3800068,0.0000280851,0.000009871412,0.00004256866,3.88134e-7,0.000005174782,0.000004287002],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5982456,"threshold_uncertainty_score":0.4983633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07460280181598752,"score_gpt":0.2791214548209429,"score_spread":0.2045186530049554,"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."}}