{"id":"W4409603827","doi":"10.61091/jcmcc127b-167","title":"Research on Approval and Global Optimal Path Planning Strategy for Bulk Transportation Based on Greedy Algorithm","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Science and Technology Department of Guangxi Zhuang Autonomous","keywords":"Greedy algorithm; Path (computing); Algorithm; Mathematical optimization; Computer science; Motion planning; Operations research; Mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007205217,0.001211717,0.00141274,0.0009924789,0.0006586178,0.001085109,0.001160532,0.0009377393,0.002688501],"category_scores_gemma":[0.001302697,0.0005608061,0.001011431,0.001168736,0.000693351,0.001308395,0.0007178631,0.0007792881,0.000278641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115133,"about_ca_system_score_gemma":0.002603677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01575124,"about_ca_topic_score_gemma":0.006972829,"domain_scores_codex":[0.9994776,0.0001289314,0.00002609932,0.0001390262,0.0001228659,0.0001055901],"domain_scores_gemma":[0.9995489,0.0002089195,0.00006107742,0.00002440711,0.000122489,0.00003422547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005447118,0.00003625875,0.0007737439,0.00009539079,0.00004182122,0.00007275181,0.00008643224,0.9433893,0.00150921,0.01237434,0.001334117,0.04023219],"study_design_scores_gemma":[0.00001875968,0.00003986067,0.0001163679,0.000006563956,0.00001367726,0.0000205294,0.00002620532,0.9959066,0.0002344997,0.002983437,0.0006256499,0.00000791506],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03425358,0.0005518876,0.9587993,0.0002473883,0.00005505221,0.0001089913,0.00005642136,0.0003527291,0.005574577],"genre_scores_gemma":[0.7042834,0.0009984375,0.2886071,0.0001791818,0.00005206458,0.0003559682,0.0002929876,0.0001172797,0.005113587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01575124,"threshold_uncertainty_score":0.03131914,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04370584523504462,"score_gpt":0.3438774879558911,"score_spread":0.3001716427208465,"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."}}