{"id":"W2966291835","doi":"10.1609/icaps.v29i1.3474","title":"A Multi-Label A* Algorithm for Multi-Agent Pathfinding","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Pathfinding; Computer science; Computation; Pickup; Set (abstract data type); Heuristic; Sequence (biology); Mathematical optimization; Path (computing); Job shop scheduling; Algorithm; Theoretical computer science; Artificial intelligence; Shortest path problem; Mathematics; Schedule; Graph","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.0007754535,0.001054197,0.0009599312,0.001227662,0.001553521,0.001188355,0.002266566,0.001845227,0.007421783],"category_scores_gemma":[0.002216324,0.0005518098,0.0009750744,0.001312806,0.000726238,0.001588445,0.001965931,0.002035805,0.002395174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189804,"about_ca_system_score_gemma":0.003017764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005261781,"about_ca_topic_score_gemma":0.006389877,"domain_scores_codex":[0.9991793,0.000234534,0.00004754901,0.0002369844,0.0001977462,0.000103859],"domain_scores_gemma":[0.9990181,0.0004009421,0.0001200776,0.0001564117,0.0001881503,0.0001163998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003254416,0.00044696,0.0008014904,0.0002663334,0.00008599147,0.000138742,0.0001397537,0.3624319,0.006304887,0.03222232,0.01985796,0.5769783],"study_design_scores_gemma":[0.00007742093,0.0001136027,0.0001102113,0.00001789989,0.00001550524,0.00007774455,0.00003505796,0.9757204,0.001950648,0.0140096,0.00785224,0.00001955084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004232226,0.0001614546,0.990651,0.00023459,0.00008073983,0.0001125352,0.00008908569,0.001570059,0.002868366],"genre_scores_gemma":[0.0755665,0.0001206714,0.9194245,0.0001986534,0.00003644759,0.0003219102,0.0003023596,0.0002189015,0.003810029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007421783,"threshold_uncertainty_score":0.02482837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08975077837246882,"score_gpt":0.3315500664996794,"score_spread":0.2417992881272106,"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."}}