{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192918,0.001012734,0.001241149,0.001029853,0.0006756773,0.001050233,0.001099839,0.0008627907,0.002069566],"category_scores_gemma":[0.01212656,0.0007807751,0.000901888,0.0009453465,0.001417079,0.001871155,0.001772936,0.001748432,0.0003361806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001620243,"about_ca_system_score_gemma":0.001959394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004821519,"about_ca_topic_score_gemma":0.005002316,"domain_scores_codex":[0.9980793,0.0008997407,0.00008034734,0.0002581286,0.000542706,0.0001398199],"domain_scores_gemma":[0.9949448,0.003743931,0.0002693839,0.0005408569,0.0003575468,0.0001435089],"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.0001711759,0.00005372756,0.0005775056,0.00007521443,0.00004372149,0.00006360621,0.00009661317,0.9199082,0.001418129,0.04052688,0.0009794513,0.03608584],"study_design_scores_gemma":[0.00001272571,0.00003010373,0.00006476215,0.000005717101,0.000004197798,0.000009953833,0.000008345819,0.9728899,0.0003861372,0.02623292,0.0003504478,0.000004882113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01770821,0.0002526092,0.9791461,0.0001268541,0.00001822681,0.00005273675,0.00006693848,0.0005278722,0.002100481],"genre_scores_gemma":[0.5450854,0.0003298495,0.4512229,0.0002204812,0.00005459041,0.0004192678,0.000459716,0.0002914589,0.001916284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004821519,"threshold_uncertainty_score":0.01175576,"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."}}