{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007108858,0.0008507659,0.0007138586,0.0007947429,0.0005339811,0.0004797765,0.00173819,0.0006405721,0.0006261843],"category_scores_gemma":[0.001540413,0.0003372557,0.0005297801,0.0005626608,0.0005463668,0.001399233,0.0009918474,0.0004396417,0.0001301663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007531465,"about_ca_system_score_gemma":0.000563968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00155491,"about_ca_topic_score_gemma":0.001616323,"domain_scores_codex":[0.9996073,0.0001175821,0.00001643436,0.00009183693,0.0001128347,0.00005404863],"domain_scores_gemma":[0.9994475,0.0002858222,0.0001053925,0.00003896618,0.00008349174,0.00003869437],"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.0001792558,0.00007184855,0.0008283465,0.0001788088,0.00007557174,0.0002954804,0.000339148,0.8368318,0.02083186,0.02718486,0.001293267,0.1118898],"study_design_scores_gemma":[0.00001158609,0.00009168962,0.0001617158,0.000007401168,0.00001529545,0.00007502947,0.00003381163,0.9918666,0.001978433,0.004896471,0.0008499675,0.00001204641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02075667,0.0004188175,0.977232,0.0001282281,0.00002252102,0.00003480412,0.00001413133,0.0002082581,0.001184699],"genre_scores_gemma":[0.8486221,0.0004686185,0.1483824,0.0000988907,0.00003624245,0.0001613727,0.00005586893,0.00006030361,0.002114321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00173819,"threshold_uncertainty_score":0.005464494,"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."}}