{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007994225,0.00104977,0.001398574,0.0005123016,0.0005504786,0.001263858,0.002022167,0.001813593,0.003013515],"category_scores_gemma":[0.004209561,0.0006131232,0.001193773,0.001217206,0.0007902303,0.003379682,0.001491859,0.001434718,0.0004356462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001063702,"about_ca_system_score_gemma":0.0009698716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004004169,"about_ca_topic_score_gemma":0.002618711,"domain_scores_codex":[0.9988747,0.0003822047,0.00005338703,0.0002994254,0.0002297997,0.0001605274],"domain_scores_gemma":[0.998578,0.0009399419,0.0001340219,0.0001580987,0.00009293399,0.0000969832],"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.0002308564,0.0001344523,0.0008731467,0.0002796689,0.0000987245,0.0003438054,0.0002236483,0.8425163,0.003094506,0.06842905,0.004291938,0.07948387],"study_design_scores_gemma":[0.00004352159,0.0001022576,0.0002706734,0.00001070734,0.00002160203,0.0001997146,0.00007866865,0.9460789,0.001240437,0.04946695,0.00246644,0.00002004581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03927645,0.0003531593,0.9560885,0.0003786144,0.00003374087,0.00008333832,0.0002419761,0.0003914612,0.003152744],"genre_scores_gemma":[0.4261667,0.0004927665,0.5684491,0.000125438,0.00006987549,0.0002695614,0.0009499301,0.0001799316,0.003296611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004004169,"threshold_uncertainty_score":0.01008123,"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."}}