Fleet Recovery
Coordinate two robots with one shared policy under actuator stalls, limited batteries, and hidden layouts.
Pieejamie uzdevumi
Izpētiet un risiniet mašīnmācīšanās izaicinājumus.
110 uzdevumi
Coordinate two robots with one shared policy under actuator stalls, limited batteries, and hidden layouts.
Build a cost-aware adaptive DAG for noisy ternary identification that remains robust under receiver shift.
Recognize known and unknown audio events, locate their boundaries, and remain calibrated under domain shift.
Design an adaptive decision graph that robustly identifies a transmitter in at most 15 calls.
Train a delivery policy that recovers from actuator stalls and generalizes to hidden layouts.
Detect overlapping sound events over time while adapting to new classes without forgetting the old ones.
Identificējiet paslēptos dzīvniekus ne vairāk kā 15 izsaukumos, adaptīvi izvēloties yes/no jautājumus un minējumus.
Izveidojiet adaptīvu YES/NO question politiku, kas identificē katru animal no 250 kandidātu kataloga, izmantojot ne vairāk kā 15 izsaukumus.
Apmāciet uzvedības klonēšanas modeli piegādāt pakas nepazīstamās 8 × 8 kartēs.