{"id":"W2047599849","doi":"10.1016/j.cor.2014.06.016","title":"An innovative multi-agent search-and-rescue path planning approach","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mathematical optimization; Motion planning; Time horizon; Constraint (computer-aided design); Path (computing); Integer programming; Variety (cybernetics); Representation (politics); Relaxation (psychology); Computational complexity theory; Computation; Bellman equation; Algorithm; Mathematics; Artificial intelligence; Robot","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.0004507663,0.0007261134,0.0008448368,0.0006973792,0.0006066909,0.0008023068,0.001723639,0.001272668,0.002171379],"category_scores_gemma":[0.0006725111,0.0004018705,0.0008129393,0.0006739291,0.000454716,0.0007418576,0.001559381,0.000878496,0.0004517747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005062912,"about_ca_system_score_gemma":0.001177988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002499949,"about_ca_topic_score_gemma":0.002946135,"domain_scores_codex":[0.999696,0.00006517128,0.00001324798,0.0000658744,0.0001281129,0.00003158256],"domain_scores_gemma":[0.9998054,0.0000686651,0.00002251561,0.00001993107,0.00005886633,0.0000246597],"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.00007291533,0.0001245267,0.0004280599,0.0001374025,0.000105662,0.0001712261,0.00009573249,0.7889625,0.007004466,0.03949566,0.003572382,0.1598295],"study_design_scores_gemma":[0.00001207302,0.00003206207,0.00004798792,0.000003928595,0.00001198239,0.00003578205,0.000008002969,0.9938874,0.0003735166,0.003988637,0.001592523,0.00000612192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002939017,0.0001259147,0.9938286,0.0001326158,0.00008136484,0.00003436755,0.00001766797,0.0001597496,0.002680715],"genre_scores_gemma":[0.2097198,0.0003133805,0.7825583,0.0002168805,0.0001144507,0.0002982417,0.00008964828,0.00006743827,0.006621933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002499949,"threshold_uncertainty_score":0.007263958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1443338905431879,"score_gpt":0.4048317940207116,"score_spread":0.2604979034775238,"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."}}