{"id":"W4288391271","doi":"10.1109/lra.2022.3194691","title":"TAPE: Tether-Aware Path Planning for Autonomous Exploration of Unknown 3D Cavities Using a Tangle-Compatible Tethered Aerial Robot","year":2022,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Université de Sherbrooke","keywords":"Travelling salesman problem; Motion planning; Path (computing); Computer science; Path length; Robot; Robotics; Function (biology); Mathematical optimization; Simulation; Algorithm; Artificial intelligence; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0004207318,0.0002128023,0.0003211843,0.0002255124,0.0005046569,0.0001613951,0.0003729388,0.00005463528,0.000004019817],"category_scores_gemma":[0.00002633014,0.0002320632,0.00006985472,0.0003176769,0.00005929298,0.0006817234,0.0001157437,0.0001520799,8.400979e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001454624,"about_ca_system_score_gemma":0.000115774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005269773,"about_ca_topic_score_gemma":6.159843e-7,"domain_scores_codex":[0.9982868,0.0001541644,0.0004810347,0.0003778425,0.0003800574,0.0003200525],"domain_scores_gemma":[0.9989115,0.0001952588,0.0004362442,0.0003120209,0.00008048012,0.00006452276],"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.000009531953,0.00004178885,0.0001049861,0.00005357814,0.00002711158,0.000009216068,0.004077907,0.9757379,0.01704644,0.0005726034,0.0003278959,0.001991092],"study_design_scores_gemma":[0.0006834354,0.0001548558,0.0001591168,0.00006746357,0.00002560143,0.00002584891,0.000319701,0.9966269,0.00123216,0.0002749278,0.0001633311,0.0002666879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05991304,0.00006085488,0.9370274,0.001049165,0.001273319,0.0004310216,0.00003067303,0.0002039864,0.0000105754],"genre_scores_gemma":[0.4625124,0.000001525854,0.5367474,0.0003991591,0.0001596551,0.00007846467,0.00004204585,0.00003030266,0.0000290689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4025994,"threshold_uncertainty_score":0.9463264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05408046532099221,"score_gpt":0.2773192504337427,"score_spread":0.2232387851127505,"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."}}