{"id":"W2703150994","doi":"10.1109/tro.2018.2830331","title":"Informed Sampling for Asymptotically Optimal Path Planning","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Heuristics; Curse of dimensionality; Motion planning; Norm (philosophy); Asymptotically optimal algorithm; Dimension (graph theory); Mathematics; Euclidean geometry; Euclidean distance; Convergence (economics); Sampling (signal processing); Computer science; State (computer science); Path (computing); Algorithm; Robot; Artificial intelligence; Filter (signal processing); Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001704878,0.0001514172,0.0001455348,0.0001192604,0.0004478346,0.000158029,0.0004120771,0.00008251217,0.00001246571],"category_scores_gemma":[0.00003039101,0.0001426165,0.00009721834,0.000227634,0.00006077607,0.0002157898,0.000003238272,0.0002501373,0.00005754859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003809153,"about_ca_system_score_gemma":0.0001225053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004602815,"about_ca_topic_score_gemma":0.000001778833,"domain_scores_codex":[0.9989219,0.00002182967,0.0002244694,0.0002775271,0.0002019248,0.0003523339],"domain_scores_gemma":[0.9989677,0.0004095426,0.00005686707,0.0003300862,0.000117433,0.0001183736],"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.00001537267,0.00005992921,0.000008868278,0.00001570113,0.00002204676,0.000001586695,0.0005077067,0.9664147,0.00007645977,0.002167698,0.0001458796,0.03056406],"study_design_scores_gemma":[0.0004268538,0.0005657753,0.0000830919,0.00006346733,0.00001636816,0.00001534901,0.00002836275,0.9955333,0.001498319,0.0002980803,0.001259121,0.000211926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009528532,0.000005205294,0.9963895,0.0005723794,0.001220368,0.0001471081,0.000005710642,0.0002943079,0.0004125638],"genre_scores_gemma":[0.2644949,0.000002814758,0.7345983,0.0003369351,0.0001853543,0.00001405094,0.000001466502,0.00001506381,0.0003511605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.263542,"threshold_uncertainty_score":0.581573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03696862076111333,"score_gpt":0.317229752122233,"score_spread":0.2802611313611197,"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."}}