Abstract— We present a method of dynamic coalition formation (DCF) in sensor networks to achieve well-informed sensor-target allocations. Forecasts of target movements are incorporated when choosing sensor states, as is a memory of target observation. The algorithm can be run in a centralized or decentralized configuration; the latter relies on local message passing in the form of the max-sum algorithm. We show how the DCF algorithm has been applied to synthetic and real data.