{"id":"W2157638946","doi":"10.1109/robot.2007.363070","title":"View Planning Problem with Combined View and Traveling Cost","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":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Workspace; Motion planning; Robot; Mathematical optimization; Rounding; Approximation algorithm; Computer science; Ackermann function; Greedy algorithm; Linear programming; Algorithm; 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.0008833013,0.001144432,0.001437002,0.0004421761,0.0006536779,0.001342116,0.001701453,0.001589629,0.006934575],"category_scores_gemma":[0.00231292,0.0007746503,0.001340546,0.0009179198,0.0007177586,0.003362598,0.001229524,0.00193278,0.000727643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008793105,"about_ca_system_score_gemma":0.001202307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003745707,"about_ca_topic_score_gemma":0.003742354,"domain_scores_codex":[0.9990954,0.0002571497,0.00004514386,0.0002602211,0.0001749001,0.0001672013],"domain_scores_gemma":[0.9987332,0.0008473967,0.0001050324,0.0001366015,0.00009198346,0.00008568946],"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.0004586087,0.0002293414,0.0009248913,0.0004692551,0.0001304622,0.000683136,0.000248728,0.8104489,0.006570134,0.05328022,0.007404647,0.1191517],"study_design_scores_gemma":[0.00007943928,0.0002166506,0.0003710973,0.0000266729,0.00005580224,0.0003787679,0.0001554204,0.9461734,0.003159679,0.04407444,0.005275399,0.00003316607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03152367,0.0004028046,0.961916,0.0004092782,0.00006029926,0.0001536706,0.0003976842,0.000483998,0.004652599],"genre_scores_gemma":[0.3785102,0.0005700112,0.6129391,0.000204947,0.00008194883,0.0003713469,0.001148486,0.0002948592,0.005879057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006934575,"threshold_uncertainty_score":0.02319849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04738791226301796,"score_gpt":0.2980496576572515,"score_spread":0.2506617453942335,"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."}}