In an RTS you can select a group of units and tell them to go to a point on the map. Obviously not every unit can actually go to that point since they occupy space.

One easy but not entirely general way is to define a group formation, interpret the destination as the middle of that formation and send each unit to a position within that formation. Some games work almost entirely like this, e.g. Age of Empires 2.

Forcing units to always have a formation is restrictive though, and sometimes it's impossible to get in the right formation due to obstacles and other units. So we need a fallback strategy. In other words a unit must have a definition of what it means to have "reached" the destination, even though it may not be possible to reach the exact destination point and it may not be possible to occupy a pre-defined position within a formation. Age of Empires 2 doesn't handle this well; units go to the "nearest" legal position even though that may cause them to clip with other units.

I've looked a lot at what Starcraft 2 does when you select a group that's too spread to keep formation (or just click in the middle of the space it occupies). Units seem to all converge towards the destination point, but then some push the others to some extent and some let themselves be pushed and the result is unpredictable, although acceptable in general. It is assumed players can just keep clicking the same point if they want units to try and group more closely. It's really hard to tell what the exact rules are though.

There seems to be a lot of literature about group movement but not much about how the pathfinding actually terminates. Any good references or insight?

Never studied this topic, but my first reaction is "it very much depends on what the game author considers good enough".

On second thought, I would say is no agreement about it, in fact, I'd see it as part of the game. Suppose you program roman soldiers against peasants and farmers. I think these two kinds of armies would arrive in totally different fashion. Roman soldiers are highly organized, and would arrive in formation. Peasants and farmers are just a bunch of random guys that never fought in their life, I'd expect them to just arrive near the place where they are supposed to arrive, in some random way. If they would arrive in formation, and the roman soldiers would arrive in disorder, it would totally ruin the atmosphere, I think!

It means whatever you implement it to mean.

The method I've usually seen is that characters attempt to reach the goal, and they will stop if they are unable to reach the goal after multiple reroute attempts. This can also help if the character becomes blocked while traveling across the map. If for some reason the character becomes blocked, perhaps someone builds walls around them, then they stop. If they approach the destination and there is a group of other units in the way, they also stop. In both cases they may attempt to reroute for a few seconds, but if they repeatedly cannot reach their goal they stop.

If your objects can push each other out of the way, you might want all of them to push each other out of the way until all of them reach the destination. It can lead to crowding, but can work. You will have the same issues of stopping if the unit becomes blocked and rerouting fails, so it is more work even though it seems similar at first.

I have seen games where formations travel together, and when you choose a destination each unit picks a navigation target relative to where they are standing; a unit standing {x+3, y-4} from the original center should target a point {x+3, y-4} from the selected destination. However, it still needs similar logic about being blocked, putting it right back to the first solution above.

That's actually one of the prime situations of Continuum Crowds !
In CC, the space is discretized into a Grid, hence a goal can't be a single point in space afterall.
Mostly, each Group's goal doesn't contain a single, but rather multiple cells.

So instead of defining a destination point, you define a destination zone? That opens up some more questions. Determining in advance the shape of the zone, taking into account static obstacles within it and the number of units going there; deciding which unit goes where inside the zone, preferably as close as possible to the center... I'm not sure it's a good idea to try to compute these things in advance. I think a system where each unit tries to get to the destination, pushing idle units out of the way (SC2-style) will adapt to obstacles dynamically and occupy close-to-optimal space without having to compute it explicitly, however the rules governing who pushes who could be complex. Obviously if every unit has to reach the point before stopping, they'll be shuffling for a very long time in case of large groups. How does the unit decide it's made a good enough effort if it can't exactly reach the point, when does it stop trying?

@Asik:

Instead of trying to copy behavior of $random game, I'd suggest you start at the other side, what do you want to happen?

Then design an algorithm that achieves that, at least for most practical cases that happen in your game.

To me, the problem looks sufficiently complicated that you will never achieve 100% perfect. Unless you write a scientific paper or do a PhD, I think that's not a problem.