{"id":"W2148837279","doi":"10.1109/robot.2007.363163","title":"Metric View Planning Problem with Traveling Cost and Visibility Range","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Metric (unit); Mathematical optimization; Approximation algorithm; Range (aeronautics); Motion planning; Greedy algorithm; Set cover problem; Mathematics; Metric space; Visibility; Set (abstract data type); Computer science; Robot; Discrete mathematics; Artificial intelligence","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00151346,0.0004470324,0.0004244115,0.000585356,0.0003654379,0.001479512,0.0007725238,0.000168188,0.000008057037],"category_scores_gemma":[0.0001612206,0.0003936435,0.00005008889,0.0008346413,0.0001539451,0.001627497,0.0001782345,0.0004688924,0.00001029946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001552363,"about_ca_system_score_gemma":0.00007515396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493667,"about_ca_topic_score_gemma":7.41478e-7,"domain_scores_codex":[0.9967272,0.000004687498,0.0006937603,0.000998861,0.0009848392,0.0005906887],"domain_scores_gemma":[0.9975445,0.0001349517,0.0005248539,0.0001034898,0.00137367,0.0003185252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002055816,0.0004246765,0.08699938,0.0007689047,0.000312759,0.00005043347,0.01013943,0.003059598,0.005008486,0.8256652,0.0007763609,0.0665892],"study_design_scores_gemma":[0.001450408,0.0004890924,0.06252931,0.001229802,0.0000535178,0.0003386495,0.0009662341,0.9224941,0.00162722,0.007700273,0.0002378208,0.0008835819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3507146,0.0002064774,0.6062616,0.005025539,0.0007199032,0.001472915,0.00001405811,0.001054652,0.0345303],"genre_scores_gemma":[0.7785639,0.00005627133,0.2207196,0.0003313551,0.0001468603,0.00003471372,0.000004548891,0.00002672803,0.0001159515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9194345,"threshold_uncertainty_score":0.9998515,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05214411790293259,"score_gpt":0.3086584691607421,"score_spread":0.2565143512578095,"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."}}