Systems and Methods for Dynamic Processing of Objects

2. The method as claimed in claim 1, wherein the method further includes dynamically assigning by the central processor additional intermediate containers to additional destinations for additional objects responsive to identifying indicia in connection with each of the additional objects.

3. The method as claimed in claim 1, wherein said method further includes changing by the central processor a status of an intermediate container to finished when the intermediate container is full.

4. The method as claimed in claim 1, wherein said method further includes generating a signal to empty the first intermediate container before the container is full and identifying the emptied first intermediate container as available for re-assignment to another destination, by the central processor, when the first intermediate container is not expected to receive another object bound for the first destination currently assigned to the first intermediate container within a given time.

5. The method as claimed in claim 1, wherein said method further includes assigning by the central processor a second intermediate container to the first destination location.

6. The method as claimed in claim 1, wherein a second intermediate container among the plurality of intermediate containers is assigned to a second destination responsive to a second object being acquired and associated with the second destination.

7. The method as claimed in claim 1, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on long-term historical usage trends and statistics.

8. The method as claimed in claim 1, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on future delivery requirements or sortation processes.

9. The method as claimed in claim 1, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on perception data regarding objects other than the acquired object that are upstream of the input area.

10. The method as claimed in claim 1, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on data regarding objects processed prior to the acquired object and each assigned to a specific one of the plurality of intermediate containers.

11. The method as claimed in claim 1, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on objects other than the acquired object currently being sorted by a plurality of programmable motion devices.

12. The method as claimed in claim 1, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on time-to-sort information.

13. The method as claimed in claim 1, wherein said method further includes using the programmable motion device to acquire a new intermediate container.

15. The method as claimed in claim 14, wherein the method further includes dynamically assigning by the central processor additional intermediate containers to additional destinations for additional objects responsive to identifying indicia in connection with each of the additional objects.

16. The method as claimed in claim 14, wherein said method further includes changing by the central processor a status of an intermediate container to finished when the intermediate container is full.

17. The method as claimed in claim 14, wherein said method further includes generating a signal to empty the first intermediate container before the container is full and identifying the emptied first intermediate container as available for re-assignment to another destination, by the central processor, when the first intermediate container is not expected to receive another object bound for the first destination currently assigned to the first intermediate container within a given time.

18. The method as claimed in claim 14, wherein said method further includes assigning by the central processor a second intermediate container to the first destination location.

19. The method as claimed in claim 14, wherein a second intermediate container among the plurality of intermediate containers is assigned to a second destination responsive to a second object being acquired and associated with the second destination.

20. The method as claimed in claim 14, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on long-term historical usage trends and statistics.

21. The method as claimed in claim 14, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on future delivery requirements or sortation processes.

22. The method as claimed in claim 14, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on perception data regarding objects other than the acquired object that are upstream of the input area.

23. The method as claimed in claim 14, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on data regarding objects processed prior to the acquired object and each assigned to a specific one of the plurality of intermediate containers.

24. The method as claimed in claim 14, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on objects other than the acquired object currently being sorted by a plurality of programmable motion devices.

25. The method as claimed in claim 14, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on time-to-sort information.

26. The method as claimed in claim 14, wherein said method further includes using the programmable motion device to acquire a new intermediate container.

28. The method as claimed in claim 27, wherein the method further includes dynamically assigning by the central processor additional intermediate containers to additional destinations for additional objects responsive to identifying indicia in connection with each of the additional objects.

29. The method as claimed in claim 27, wherein said method further includes changing by the central processor a status of an intermediate container to finished when the intermediate container is full.

30. The method as claimed in claim 27, wherein said method further includes generating a signal to empty the first intermediate container before the container is full and identifying the emptied first intermediate container as available for re-assignment to another destination, by the central processor, when the first intermediate container is not expected to receive another object bound for the first destination currently assigned to the first intermediate container within a given time.

31. The method as claimed in claim 27, wherein said method further includes assigning by the central processor a second intermediate container to the first destination location.

32. The method as claimed in claim 27, wherein a second intermediate container among the plurality of intermediate containers is assigned to a second destination responsive to a second object being acquired and associated with the second destination.

33. The method as claimed in claim 27, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on long-term historical usage trends and statistics.

34. The method as claimed in claim 27, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on future delivery requirements or sortation processes.

35. The method as claimed in claim 27, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on perception data regarding objects other than the acquired object that are upstream of the input area.

36. The method as claimed in claim 27, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on data regarding objects processed prior to the acquired object and each assigned to a specific one of the plurality of intermediate containers.

37. The method as claimed in claim 27, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on objects other than the acquired object currently being sorted by a plurality of programmable motion devices.

38. The method as claimed in claim 27, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on time-to-sort information.

39. The method as claimed in claim 27, wherein said method further includes using the programmable motion device to acquire a new intermediate container.