{"id":"W4390296083","doi":"10.1016/j.engappai.2023.107770","title":"A 3D-RRT-star algorithm for optimizing constrained mountain railway alignments","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Discretization; Obstacle; Path (computing); Constraint (computer-aided design); A* search algorithm; Algorithm; Process (computing); Heuristic; Random tree; Sampling (signal processing); Set (abstract data type); Star (game theory); Tree (set theory); Motion planning; Mathematics; Artificial intelligence","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.000570901,0.0001934525,0.000236403,0.0003308717,0.0001416259,0.00008231953,0.000952641,0.00008248892,0.000004845821],"category_scores_gemma":[0.000117156,0.0002235679,0.00008554686,0.001268349,0.00006932054,0.0001903782,0.0001479087,0.0001227415,0.00009952734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006004513,"about_ca_system_score_gemma":0.00006733568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001887718,"about_ca_topic_score_gemma":2.797514e-7,"domain_scores_codex":[0.9982786,0.00001558741,0.0005401975,0.0004596683,0.0002753641,0.0004305471],"domain_scores_gemma":[0.9985416,0.0004280196,0.0001348334,0.0006300989,0.0001535698,0.0001118866],"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.000001973999,0.00006431853,0.000003056539,0.0000408248,0.00004144627,0.000003605538,0.0005958613,0.4888772,0.008791325,0.04972417,0.00009955042,0.4517567],"study_design_scores_gemma":[0.0000337991,0.00004443188,0.00001147855,0.00003412343,0.000008484648,0.000005017137,0.0001265232,0.9672914,0.028468,0.002903359,0.0008648118,0.000208575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002412192,0.0000431227,0.9978775,0.0002058373,0.0002264783,0.0006956597,0.00004831286,0.0006102775,0.00005157316],"genre_scores_gemma":[0.02195992,0.00001208672,0.9771369,0.00002041668,0.000108176,0.0006373045,0.00003212327,0.00002497589,0.00006810226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4784142,"threshold_uncertainty_score":0.9116833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03018213210380971,"score_gpt":0.2856380456883223,"score_spread":0.2554559135845126,"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."}}