{"id":"W2315526458","doi":"10.1109/tac.2016.2536800","title":"Maximum Lifetime Strategy for Target Monitoring With Controlled Node Mobility in Sensor Networks With Obstacles","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; McGill University","funders":"National Institute of Standards and Technology","keywords":"Computer science; Wireless sensor network; Maximization; Real-time computing; Energy consumption; Path (computing); Graph; Energy (signal processing); Shortest path problem; Node (physics); Mathematical optimization; Computer network; Engineering; Mathematics; Theoretical computer science","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"],"consensus_categories":[],"category_scores_codex":[0.0005047569,0.0004499153,0.0008230472,0.0002412173,0.0002190064,0.0001622879,0.0005560383,0.0001725622,0.00002457965],"category_scores_gemma":[0.00001618582,0.0002749349,0.000177421,0.0004801845,0.0001327169,0.0003837657,0.000002368846,0.0002201775,0.00001002906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002069484,"about_ca_system_score_gemma":0.0001390008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003569235,"about_ca_topic_score_gemma":0.00009623612,"domain_scores_codex":[0.9970711,0.0002447368,0.0006570335,0.000759895,0.0004585184,0.0008087454],"domain_scores_gemma":[0.9964018,0.002072843,0.0002503577,0.0008873174,0.0001874196,0.0002002048],"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.0008994946,0.0004471508,0.0002518576,0.0000216282,0.0001608618,0.00002372487,0.00007936497,0.9703239,0.0005450135,0.0000788058,0.000005978414,0.02716218],"study_design_scores_gemma":[0.02036543,0.0006551938,0.001202525,0.00035124,0.00006720562,0.00001791705,0.00004107057,0.975102,0.001705544,0.00005594973,0.00001374637,0.0004221998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07041059,0.00006059975,0.9262115,0.0006168252,0.0003892763,0.001701935,0.00001710394,0.0005383583,0.00005374933],"genre_scores_gemma":[0.9465476,0.00001013337,0.05219041,0.00008752484,0.00007458468,0.0008688135,6.085253e-7,0.00004972298,0.0001706391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.876137,"threshold_uncertainty_score":0.9999703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01090006933723607,"score_gpt":0.2262619117941881,"score_spread":0.2153618424569521,"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."}}