{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001016295,0.0004704155,0.000441468,0.0003835096,0.0003878282,0.00156443,0.0007925949,0.0001624731,0.000008625304],"category_scores_gemma":[0.00007979996,0.0004185784,0.00004576276,0.0005109938,0.0001566572,0.001484283,0.0001792003,0.0004601264,0.00001343278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113672,"about_ca_system_score_gemma":0.00007747667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000933416,"about_ca_topic_score_gemma":5.996184e-7,"domain_scores_codex":[0.996928,0.00000398841,0.0006941914,0.0008926808,0.0008918934,0.0005892644],"domain_scores_gemma":[0.997728,0.00009745605,0.0005337613,0.00009374442,0.001233261,0.0003137864],"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.0001126842,0.0002153256,0.01370218,0.000483873,0.0001888989,0.00003444973,0.00565032,0.001410779,0.004335961,0.9392325,0.0007301338,0.03390284],"study_design_scores_gemma":[0.001798509,0.0007178391,0.02003538,0.002707164,0.00005773792,0.0004575507,0.001045451,0.9590513,0.002061766,0.01037669,0.0006405258,0.001050166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2854403,0.0003021326,0.6303583,0.0132971,0.00125999,0.002256981,0.00001721348,0.001763547,0.0653044],"genre_scores_gemma":[0.7725288,0.000109105,0.2262845,0.0006243172,0.0001581839,0.0000468912,0.000007943765,0.00003628252,0.0002040271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9576405,"threshold_uncertainty_score":0.9998266,"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."}}