Abstract: A method for controlling a transport robot is provided. The method includes the steps of: acquiring, when a user makes a request for transport of a target object, information on the user and information on the transport of the target object including a delivery place of the target object; identifying the user on the basis of the information on the user, and determining a place associated with the user as a destination where a transport robot is to transport the target object from the delivery place, with reference to a result of the identification; and causing the target object to be transported to the destination by the transport robot.

Abstract: According to one aspect of the invention, there is provided a method for generating a map for a robot, the method comprising the steps of: acquiring a raw map associated with a task of the robot; identifying pixels estimated to be a moving obstacle in the raw map, on the basis of at least one of colors of pixels specified in the raw map and sizes of areas associated with the pixels; and performing dilation and erosion operations on the pixels estimated to be the moving obstacle, and determining a polygon-based contour of the moving obstacle.

Abstract: A robot includes: a base having a plurality of wheels; a body having a bottom portion coupled above the base, and a top portion above the bottom portion, the top portion configured to support food and/or drink; a first camera at the bottom portion, wherein the first camera is oriented to view upward; and a second camera at the top portion, wherein the second camera is configured to view upward.

Abstract: A robot includes: a base having a plurality of wheels; a body having a bottom portion coupled above the base, and a top portion above the bottom portion, the top portion configured to support food and/or drink; a first camera at the bottom portion, wherein the first camera is oriented to view upward; and a second camera at the top portion, wherein the second camera is configured to view upward.

Abstract: A method for controlling a transport robot is provided. The method includes the steps of: acquiring, when a user makes a request for transport of a target object, information on the user and information on the transport of the target object including a delivery place of the target object; identifying the user on the basis of the information on the user, and determining a place associated with the user as a destination where a transport robot is to transport the target object from the delivery place, with reference to a result of the identification; and causing the target object to be transported to the destination by the transport robot.

Abstract: According to one aspect of the invention, there is provided a method for generating a map for a robot, the method comprising the steps of: acquiring a raw map associated with a task of the robot; identifying pixels estimated to be a moving obstacle in the raw map, on the basis of at least one of colors of pixels specified in the raw map and sizes of areas associated with the pixels; and performing dilation and erosion operations on the pixels estimated to be the moving obstacle, and determining a polygon-based contour of the moving obstacle.

Abstract: A robot includes: a base having a plurality of wheels; a motor system mechanically coupled to one or more of the wheels; a body having a bottom portion coupled above the base, and a top portion above the bottom portion; a support at the top portion, wherein the support is configured to withstand a temperature that is above 135° F.; and a processing unit configured to operate the robot.

Abstract: A robot includes: a base having a plurality of wheels; a motor system mechanically coupled to one or more of the wheels; a body having a bottom portion coupled above the base, and a top portion above the bottom portion; a support at the top portion, wherein the support is configured to withstand a temperature that is above 135° F.; and a processing unit configured to operate the robot.

Abstract: A robot includes: a base having a plurality of wheels; a body having a bottom portion coupled above the base, and a top portion above the bottom portion, the top portion configured to support food and/or drink; a first camera at the bottom portion, wherein the first camera is oriented to view upward; and a second camera at the top portion, wherein the second camera is configured to view upward.

Abstract: The present disclosure is directed to a flexible counter system for memory protection. In general, a counter system for supporting memory protection operations in a device may be made more efficient utilizing flexible counter structures. A device may comprise a processing module and a memory module. A flexible counter system in the memory module may comprise at least one data line including a plurality of counters. The bit-size of the counters may be reduced and/or varied from existing implementations through an overflow counter that may account for smaller counters entering an overflow state. Counters that utilize the overflow counter may be identified using a bit indicator. In at least one embodiment selectors corresponding to each of the plurality of counters may be able to map particular memory locations to particular counters.

Abstract: Examples include techniques for compressing counter values included in cryptographic metadata. In some examples, a cache line to fill a cache included in on-die processor memory may be received. The cache arranged to store cryptographic metadata. The cache line includes a counter value generated by a counter. The counter value to serve as version information for a memory encryption scheme to write a data cache line to a memory location of an off-die memory. In some examples, the counter value is compressed based on whether the counter value includes a pattern that matches a given pattern and is then stored to the cache. In some examples, a compression aware and last recently used (LRU) scheme is used to determine whether to evict cryptographic metadata from the cache.

Abstract: The present disclosure is directed to a flexible counter system for memory protection. In general, a counter system for supporting memory protection operations in a device may be made more efficient utilizing flexible counter structures. A device may comprise a processing module and a memory module. A flexible counter system in the memory module may comprise at least one data line including a plurality of counters. The bit-size of the counters may be reduced and/or varied from existing implementations through an overflow counter that may account for smaller counters entering an overflow state. Counters that utilize the overflow counter may be identified using a bit indicator. In at least one embodiment selectors corresponding to each of the plurality of counters may be able to map particular memory locations to particular counters.

Abstract: The present disclosure is directed to a flexible counter system for memory protection. In general, a counter system for supporting memory protection operations in a device may be made more efficient utilizing flexible counter structures. A device may comprise a processing module and a memory module. A flexible counter system in the memory module may comprise at least one data line including a plurality of counters. The bit-size of the counters may be reduced and/or varied from existing implementations through an overflow counter that may account for smaller counters entering an overflow state. Counters that utilize the overflow counter may be identified using a bit indicator. In at least one embodiment selectors corresponding to each of the plurality of counters may be able to map particular memory locations to particular counters.

Abstract: In an embodiment, a processor includes: at least one core to execute instructions; and a memory protection logic to encrypt data to be stored to a memory coupled to the processor, generate a message authentication code (MAC) based on the encrypted data, the MAC to have a first value according to a first key, obtain the encrypted data from the memory and validate the encrypted data using the MAC, where the MAC is to be re-keyed to have a second value according to a second key and without the encrypted data. Other embodiments are described and claimed.

Abstract: In an embodiment, a processor includes: at least one core to execute instructions; a cache memory coupled to the at least one core to store data; and a tracker cache memory coupled to the at least one core. The tracker cache memory includes entries to store an integrity value associated with a data block to be written to a memory coupled to the processor. Other embodiments are described and claimed.

Abstract: Examples include techniques for compressing counter values included in cryptographic metadata. In some examples, a cache line to fill a cache included in on-die processor memory may be received. The cache arranged to store cryptographic metadata. The cache line includes a counter value generated by a counter. The counter value to serve as version information for a memory encryption scheme to write a data cache line to a memory location of an off-die memory. In some examples, the counter value is compressed based on whether the counter value includes a pattern that matches a given pattern and is then stored to the cache. In some examples, a compression aware and last recently used (LRU) scheme is used to determine whether to evict cryptographic metadata from the cache.

Abstract: Systems, apparatuses and methods may provide for receiving an incoming request to access a memory region protected by counter mode encryption and a counter tree structure having a plurality of levels. Additionally, the incoming request may be accepted and a determination may be made as to whether to suspend the incoming request on a per-level basis with respect to the counter tree structure.

Abstract: In an embodiment, a processor includes: at least one core to execute instructions; and a memory protection logic to encrypt data to be stored to a memory coupled to the processor, generate a message authentication code (MAC) based on the encrypted data, the MAC to have a first value according to a first key, obtain the encrypted data from the memory and validate the encrypted data using the MAC, where the MAC is to be re-keyed to have a second value according to a second key and without the encrypted data. Other embodiments are described and claimed.

Abstract: The present disclosure is directed to a flexible counter system for memory protection. In general, a counter system for supporting memory protection operations in a device may be made more efficient utilizing flexible counter structures. A device may comprise a processing module and a memory module. A flexible counter system in the memory module may comprise at least one data line including a plurality of counters. The bit-size of the counters may be reduced and/or varied from existing implementations through an overflow counter that may account for smaller counters entering an overflow state. Counters that utilize the overflow counter may be identified using a bit indicator. In at least one embodiment selectors corresponding to each of the plurality of counters may be able to map particular memory locations to particular counters.

Abstract: Systems, apparatuses and methods may provide for receiving an incoming request to access a memory region protected by counter mode encryption and a counter tree structure having a plurality of levels. Additionally, the incoming request may be accepted and a determination may be made as to whether to suspend the incoming request on a per-level basis with respect to the counter tree structure.